Generation of Binary Trees in B-Order From (0-1) Sequences
Main Article Content
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
Download data is not yet available.
Article Details
How to Cite
Ahrabian, H., & Nowzari-Dalini, A. (2004). Generation of Binary Trees in B-Order From (0-1) Sequences. Malaysian Journal of Computer Science, 17(1), 24–31. Retrieved from https://mjs.um.edu.my/index.php/MJCS/article/view/6183
Section
Articles