Generation of Binary Trees in B-Order From (0-1) Sequences

Authors

  • Hayadeh Ahrabian Faculty of Science, University of Tehran
  • Abbas Nowzari-Dalini Faculty of Science, University of Tehran

Keywords:

Binary trees, B-order, 0-1 Sequences, Recursion

Abstract

An efficient recursive algorithm has been developed to generate binary trees in B-order from 0-1 sequences. The generation algorithm produces each tree in constant average time O(1). The ranking and unranking algorithms with O(n) time complexity are also presented.

Downloads

Published

2004-06-01

How to Cite

Generation of Binary Trees in B-Order From (0-1) Sequences. (2004). Malaysian Journal of Computer Science, 17(1), 24-31. http://mojem.um.edu.my/index.php/MJCS/article/view/6183

Similar Articles

1-10 of 131

You may also start an advanced similarity search for this article.