构造二叉树算法的研究

Research on the Construction A Binary Tree Algorithm

本文介绍了由一棵二叉树的某两种遍历序列或某种遍历序列和结点的某种信息可以唯一确定该二叉树的各种可能方法。同时本文将给出基于先序序列和结点右孩子情况的构造二叉树的非递归的新算法。

This article describes two kinds by the traversal of a binary tree or a sequence of node traversal sequences,and some information can uniquely identify the various possible ways the binary tree.This article will also be given based on the sequence and order situation of the right child nodes of non-recursive binary tree structure of the new algorithm.