binaryNode 和 binarysearchtree 是实现了一个二叉树。arrayvector是自己实现的vector。binary search 是一个二元搜索方法。 single list是自己实现的一个单向链表。findthemajority是寻找数组中主元素的一个算法。list是用数组实现的一个链表。permute是一个实现全排列的算法。-binaryNode and binarysearchtree is the realization of a binary tree. arrayvector achieve vector. The binary search is a binary search method. The single list is to achieve a one-way linked list. findthemajority an algorithm to find the main elements of the array. The list is a linked list using an array. The permute Is a full array algorithm.