| 由后序序列和结点的双亲情况构造严格二叉树的非递归算法 |
| |
| 引用本文： | 唐自立.由后序序列和结点的双亲情况构造严格二叉树的非递归算法[J].南通职业大学学报,2014(4):93-98. |
| |
| 作者姓名： | 唐自立 |
| |
| 作者单位： | 苏州大学 计算机科学与技术学院,江苏 苏州,215006 |
| |
| 基金项目： | 国家自然科学基金(61075040)；江苏省省属高校自然科学研究重大项目(10KJA52004)；江苏省自然科学基金(BK2012645)；江苏省产学研联合创新资金 |
| |
| 摘 要： | 提出一种新的由一棵严格二叉树的后序序列和结点的双亲情况构造该严格二叉树的非递归算法。通过实例说明该算法的执行过程,假设n是严格二叉树的结点的个数,该算法的时间复杂度和最差情况空间复杂度都是O（n）。
|
| 关 键 词： | 非递归算法 严格二叉树 后序序列 结点的双亲 严格二叉树构造 |
A Non-recursive Algorithm for Constructing a Strictly Binary Tree from Its Post-order Traversal and the Parent of Each Node |
| |
| TANG Zi-li.A Non-recursive Algorithm for Constructing a Strictly Binary Tree from Its Post-order Traversal and the Parent of Each Node[J].Journal of Nantong Vocational College,2014(4):93-98. |
| |
| Authors: | TANG Zi-li |
| |
| Institution: | TANG Zi-li (School of Computer Science and Technology, Soochow University, Suzhou 215006, China) |
| |
| Abstract: | A new non-recursive algorithm is presented for constructing a strictly binary tree from its post-or-der traversal and the parent of each node. The execution of the algorithm is illustrated by an example. Let n be the number of nodes of a strictly binary tree. The time complexity and the worst case space complexity of the algorithm are both O（n）. |
| |
| Keywords: | non-recursive algorithm strictly binary tree postorder traversal parent of node strictly binary tree construction |
| 本文献已被 维普 等数据库收录！ |
