Information | |
---|---|
has gloss | eng: In computer science, a left child-right sibling binary tree is a binary tree representation of a k-ary tree. The process of converting from a k-ary tree to an LC-RS binary tree is not reversible in general without additional information. |
lexicalization | eng: Left child-right sibling binary tree |
instance of | e/Binary tree |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint