首页> 外文会议>International Conference on Advanced Computer Theory and Engineering >THE PREORDER SEQUENCE AND THE INORDER SEQUENCE CANNOT UNIQUELY DETERMINE A BINARY TREE
【24h】

THE PREORDER SEQUENCE AND THE INORDER SEQUENCE CANNOT UNIQUELY DETERMINE A BINARY TREE

机译:预订序列和InOrder序列不能唯一地确定二叉树

获取原文

摘要

In most of the Data Structure textbooks there is a conclusion: "Given the preoder and the inorder sequence of nodes, the binary tree structure can be determined exclusively". This paper gives a counter example to prove this conclusion is wrong, and analzes the reason which cause the error in the original proof. Finally, some special cases of this issue is discussed.
机译:在大多数数据结构教科书中,存在结论:“给定预码器和节点的inOlder序列,可以专门确定二进制树结构”。本文给出了一个相反的例子来证明这一结论是错误的,并分析原因原因,导致原始证明中的错误。最后,讨论了一些特殊情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号