Title:
Create_and_bianli_BiTree
Download
Description: c language implementation of the algorithm is thinking: According to the definition of complete binary tree, according to the complete binary tree from top to bottom, left to right preorder traversal of the hierarchy should be satisfied: (1) a node, there is no left child, then certainly no right-child (2) a shortage of left or right child nodes, then all its successors will no children. If not meet any of the above one, are not as complete binary tree. (3) the use of the stack preorder traversal
To Search:
File list (Check if you may need any files):
实验二二叉树.doc
