摘要
用二叉树的前序遍历、中序遍历、后序遍历的序列或结点度表示法都无法还原为唯一的一棵二叉树,中序遍历和结点度表示法二者结合组成一个序列,此序列也无法还原为唯一的一棵二叉树.但是用堆栈的方式可以将已知一棵二叉树包含结点度的后序遍历的序列还原为二叉树,而且此二叉树是唯一的.
A binary tree cannot be reverted to the only binary tree by using the sequence of preorder traversal, inorder traversal, postorder traversal or Node - Degree. A binary tree also cannot be reverted to the only one by combining the sequence of inorder traversal and node degree and traversal sequence can be reverted to one. N a ode - Degree. But a binary tree which contains the binary tree by using the stack, and it is the only
出处
《重庆文理学院学报（自然科学版）》
2008年第4期65-66,共2页
Journal of Chongqing University of Arts and Sciences
关键词
二叉树
结点度
后序遍历
Binary Tree
Node - Degree
postorder traversal
