首页 | 本学科首页   官方微博 | 高级检索  
     


Constructing a binary tree efficiently from its traversals
Abstract:In this note we streamline an earlier algorithm for constructing a binary tree from its inorder and preorder traversals. The new algorithm is conceptually simpler than the earlier algorithms and its time complexity has a smaller constant facto.
Keywords:Algorithms  Binary trees  Tree traversals
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号