Построение двоичного дерева на основе модифицированной схемы хранения…
9
Creation of a binary tree based on the modified storage
diagram of general appearance trees
«left child — right sibling» (LCRS)
© N.S. Gritsenko, Yu.S. Belov
Kaluga Branch of Bauman Moscow State Technical University, Kaluga, 248000, Russia
The article examines the following aspects: tree storage diagram with arbitrary branch-
ing "Left child – right sibling" (LCRS), the modified diagram LCRS for creation of a bi-
nary 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.
Keywords:
types and data structures, graphs, trees, binary trees.
REFERENCES
Aho A., Ullman J., Hopcroft J.
Struktury dannykh i algoritmy
[Data structures
and algorithms]. [in Russian]. Moscow, "Vilyams" Publ., 2003, 384 p.
Virt N.
Algoritmy i struktury dannykh
[Algorithms and Data Structures]. [in
Russian]. Moscow, DMK Press, 2010, 272 p.
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.
Gritsenko N.S.
(b.
1993) is a Bachelor degree student of the Department of Computer
Software, Information Technologies, Applied Mathematics at Kaluga branch of Bauman
Moscow State Technical University. Academic interests include information technology,
types and data structures, graphs, trees. e-mail:
Belov Yu.S.
(b. 1982) graduated from Kaluga branch of Bauman Moscow State Technical
University in 2006. Ph.D., Assoc. Professor of the Department of Computer Software,
Information Technologies, Applied Mathematics at Kaluga branch of Bauman Moscow
State Technical University. Research interests include information technologies,
computer simulation, intellectual data analysis. e-mail:
