Special features of the structures and functioning of search binary tree with "barrier"
Published: 11.10.2014
Authors: Gritsenko N.S., Belov Yu.S.
Published in issue: #4(28)/2014
DOI: 10.18698/2308-6033-2014-4-1282
Category: Information technology
The main purpose of the article is to examine the following aspects: structural organization of a search binary tree with a "barrier". Special features of its creation and functioning are described. A graphical mapping schemes of the binary tree store is given. We considered implementation of algorithms for searching and construction of a binary tree.
References
[1] Virt N. Algoritmy i struktury dannykh [Algorithms and Data Structures]. [in Russian]. Moscow, DMK Press, 2010, 272 p.
[2] Aho A., Ullman J., Hopcroft J. Struktury dannykh i algoritmy [Data structures and algorithms]. [in Russian]. Moscow, "Vilyams" Publ., 2003, 384 p.
[3] Kormen T., Leizerson Ch., Rivest R. Algoritmy: postroenie i analiz [Algorithms: construction and analysis]. [in Russian]. Shenia A., ed. Moscow, Moscow Center for Continuous Mathematical Education, 2002, 906 p.
[4] 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.
[5] Koffman E.B., Wolfgang P.A.T. Objects, abstraction, data structures and desing using C++, Wiley, 2005, 832 p.
[6] Weiss M.A. Data structures and algorithm analysis in Java, Prentice Hall, 2011, 640 p.