求二叉树深度与节点数的集合，递归与非递归方法

二叉排序树的建立和遍历的程序，里面有多种遍历的方法，可以满足不同的需要。-Binary sort tree traversal of the establishment and procedures, there are a variety of ways to traverse to meet different needs.

利用构造完全二叉树的方法建立二叉树结构，并实现二叉树的先序、中序、后序遍历以及求深度操作。 例如：依次输入字符ABCDE#F##G####H-Constructed using methods established complete binary tree binary tree structure, and to achieve binary tree preorder, inorder, preorder, and the depth of the operation. For

关键路径问题，用二叉树的方法去实现如何和查找关键的路途，帮助你怎样选择最佳路径。-Critical path problem, the binary tree method to achieve and how to find the key to the road, to help you how to choose the best path.