Description: Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the characters, the characters must be the right word is greater than the tree root node of the characters, the value of each node are emergence of the number of characters and character and use three kinds of traversal methods to print, comparisons are consistent with their own imagination. Again and ask for the depth of leaf nodes, the largest node values.
To Search:
File list (Check if you may need any files):
BiTree.c
二叉树应用.doc
Download