结点度数组表示下的二叉树上两个算法的优化

Two improved algorithms on any binary tree represented by the node-degree array

先从理论上证明结点度数组表示下的二叉树上结点之间存在的某种关系 ,然后运用该关系 ,优化求二叉树上任意一个结点的左儿子结点和父亲结点的两个算法 .

A relationship between nodes on any binary tree represented by the node-degree array is given and proved. Applying the relationship, two algorithms for left-child and the parent of any node on the binary tree, respectively, are improved.