Introduction - If you have any usage issues, please Google them yourself
(1) input sequence of characters, the establishment of binary list. (2) traversal of binary tree: recursive algorithm. (3) in order binary tree traversal: Non-recursive algorithm (the best can achieve the first order, after the sequence of non-recursive algorithm). (4) for tree height. (5) for the number of tree leaves. (6) in order to establish clues to binary tree and traversal implementation. (8) through the queue to achieve the level of binary tree traversal. (9) in the main function in the design of a simple menu, respectively, the above algorithm debugging.
Packet : 111186742treebintree.rar filelist
树和二叉树.doc
树和二叉树\树和二叉树.dsw
树和二叉树\树和二叉树.ncb
树和二叉树\树和二叉树.plg
树和二叉树\树和二叉树.dsp
树和二叉树\树和二叉树.cpp
树和二叉树\树和二叉树.opt
树和二叉树\Debug
树和二叉树