本程序设计实现抽象数据类型二叉树的演示程序-Design and Implementation of the program abstract data types binary tree demo program

这个程序通过dp来构建最优的二叉树，使得效率更好，将高概率的结点放在高处。通过o（n^2)实现。-To build this program by dp optimal binary tree, making better efficiency, the high probability of the node on the height. O (n ^ 2).

该程序是实现双亲表的算法，主要用于二叉树的应用-The procedure is the algorithm of the parent table, mainly used for the application of the binary tree

单链表，单循环链表，双链表，循环双链表的实现，二叉树的遍历与实现。森林与树的转换以及图的深度广度遍历，邻接矩阵邻接表实现-Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of