Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Nantong University(Natural Science Edition)》 2013-01
Add to Favorite Get Latest Update

An Efficient Algorithm for Constructing a Strictly Binary Tree from Preorder Traversal and Left Child of Each Node

TANG Zi-li(School of Computer Science and Technology,Suzhou University,Suzhou 215006,China)  
A new non-recursive algorithm is presented for constructing a strictly binary tree from its preorder traversal and the left child of each node.The execution of the new algorithm is illustrated by an example.Let n be the number of nodes of a strictly binary tree.The time complexity of the new algorithm is O(n),and it is lower than that of the equivalent recursive algorithm.The worst case space complexity of the new algorithm is O(n),and it is the same as that of the equivalent recursive algorithm.
【Fund】: 国家自然科学基金项目(61075040)
【CateGory Index】: TP311.12
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved