BiTree

实现排序操作SortDemoSortDemo.rar,很不错的vc源码，希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)

说明：  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)

按照一定的输入求出二叉树的层次遍历，输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)

无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)

开括号和比括号的匹配，数据结构内容，很不错(More than brackets and brackets to open the match, the contents of data structure)

c++ data struct stack

计算边介数,复杂网络，中心性计算，介数也可以计算，运用了数据结构，计算大量数据(edge betweenness，complex network， centrality)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)