二叉树遍历重构的一种新的非递归算法

2010 International Conference on Advances in Recent Technologies in Communication and Computing Pub Date : 2010-10-16 DOI:10.1109/ARTCOM.2010.88

V. V. Das

{"title":"二叉树遍历重构的一种新的非递归算法","authors":"V. V. Das","doi":"10.1109/ARTCOM.2010.88","DOIUrl":null,"url":null,"abstract":"This paper presents a new non-recursive algorithm for reconstructing a binary tree from its traversals. Binary tree traversal refers to the process of visiting each node in a specified order. Given the in order traversal of a binary tree, along with one of its preorder or post order traversals, the original binary tree can be uniquely identified. This algorithm is efficient and requires O(n) time and O(n) space. The implementation of this algorithm was done in C and the complete algorithm was tested. The new algorithm was found to be faster than other non-recursive algorithms.","PeriodicalId":398854,"journal":{"name":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A New Non-recursive Algorithm for Reconstructing a Binary Tree from its Traversals\",\"authors\":\"V. V. Das\",\"doi\":\"10.1109/ARTCOM.2010.88\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new non-recursive algorithm for reconstructing a binary tree from its traversals. Binary tree traversal refers to the process of visiting each node in a specified order. Given the in order traversal of a binary tree, along with one of its preorder or post order traversals, the original binary tree can be uniquely identified. This algorithm is efficient and requires O(n) time and O(n) space. The implementation of this algorithm was done in C and the complete algorithm was tested. The new algorithm was found to be faster than other non-recursive algorithms.\",\"PeriodicalId\":398854,\"journal\":{\"name\":\"2010 International Conference on Advances in Recent Technologies in Communication and Computing\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Advances in Recent Technologies in Communication and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARTCOM.2010.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Advances in Recent Technologies in Communication and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARTCOM.2010.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文提出了一种新的基于二叉树遍历重构二叉树的非递归算法。二叉树遍历是指按照指定的顺序遍历每个节点的过程。给定二叉树的有序遍历，以及它的一个预序或后序遍历，原始二叉树可以被唯一标识。该算法效率高，只需要O(n)时间和O(n)空间。用C语言实现了该算法，并对完整的算法进行了测试。新算法比其他非递归算法更快。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A New Non-recursive Algorithm for Reconstructing a Binary Tree from its Traversals

This paper presents a new non-recursive algorithm for reconstructing a binary tree from its traversals. Binary tree traversal refers to the process of visiting each node in a specified order. Given the in order traversal of a binary tree, along with one of its preorder or post order traversals, the original binary tree can be uniquely identified. This algorithm is efficient and requires O(n) time and O(n) space. The implementation of this algorithm was done in C and the complete algorithm was tested. The new algorithm was found to be faster than other non-recursive algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 International Conference on Advances in Recent Technologies in Communication and Computing

自引率

0.00%

发文量