Creation of a binary tree based on the modified storage diagram of general appearance trees "left child - right sibling" (LCRS)
Published: 11.10.2014
Authors: Gritsenko N.S., Belov Yu.S.
Published in issue: #3(27)/2014
DOI: 10.18698/2308-6033-2014-3-1281
Category: Information technology
The article examines the following aspects: tree storage diagram with arbitrary branching "Left child - right sibling" (LCRS), the modified diagram LCRS for creation of a binary tree, a tree creation algorithm with a children order, algorithm of adding a node in the modified diagram LCRS and algorithm of node quantity counting in LCRS binary tree.
References
[1] Aho A., Ullman J., Hopcroft J. Struktury dannykh i algoritmy [Data structures and algorithms]. [in Russian]. Moscow, "Vilyams" Publ., 2003, 384 p.
[2] Virt N. Algoritmy i struktury dannykh [Algorithms and Data Structures]. [in Russian]. Moscow, DMK Press, 2010, 272 p.
[3] Knut D.E. Iskusstvo programmirovaniya. Generatsiya vsekh derev’ev. Istoriya kombinatornoi generatsii [Art of Computer Programming. Generation of all trees. History of combinatorial generation]. [in Russian]. Moscow, "Vilyams" Publ., vol. 4, iss. 4, 2007, 160 p.