二叉树构造的唯一性证明及程序实现

The Proof and Realization of Uniqueness in Constructing Binary Tree

目的 揭示二叉树及其遍历的相互确定关系 .方法 数学归纳法 .结果与结论 证明了由一棵二叉树的前序遍历和中序遍历序列能唯一确定一棵二叉树 ,并且用

Aim: To reveal the relationship between a binary tree and its traversal sequence. Methods: Mathematic induction method is used. Results and Conclusion: The preorder traversal sequence and midorder traversal sequence can be used to construct a binary tree uniquely. Moreover, the program in VC is given.