Left-child right-sibling binary tree
In computer science, a left-child, right-sibling binary tree is a binary tree representation of a k-ary tree.[1] The process of converting from a k-ary tree to an LC-RS binary tree is sometimes called a Knuth transform.[2]
To form a binary tree from an arbitrary k-ary tree by this method, the root of the original tree is made the root of the binary tree. Then, starting with the root, each node's leftmost child in the original tree is made its left child in the binary tree, and its nearest sibling to the right in the original tree is made its right child in the binary tree.[3]
If the original tree was sorted, the new tree will be a binary search tree.
See also
References
- ^
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein (2001). Introduction To Algorithms (2nd ed.). MIT Press. pp. 214–217. ISBN 9780262032933.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Computer Data Structures. John L. Pfaltz.
- ^
This article incorporates public domain material from Paul E. Black. "Left child-right sibling binary tree". Dictionary of Algorithms and Data Structures. NIST.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |