南通职业大学学报Issue(4)：93-98,6.DOI:10.3969/j.issn.1008-5327.2014.04.024
由后序序列和结点的双亲情况构造严格二叉树的非递归算法
A Non-recursive Algorithm for Constructing a Strictly Binary Tree from Its Post-order Traversal and the Parent of Each Node
摘要
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).关键词
非递归算法/严格二叉树/后序序列/结点的双亲/严格二叉树构造Key words
non-recursive algorithm/strictly binary tree/postorder traversal/parent of node/strictly binary tree construction分类
信息技术与安全科学引用本文复制引用
唐自立..由后序序列和结点的双亲情况构造严格二叉树的非递归算法[J].南通职业大学学报,2014,(4):93-98,6.基金项目
国家自然科学基金（61075040）；江苏省省属高校自然科学研究重大项目（10KJA52004）；江苏省自然科学基金（BK2012645）；江苏省产学研联合创新资金 （）
