Kriegel, H. P.; Vaishnavi, V. K.; Wood, D. 2-3 brother trees. (English) Zbl 0405.68054 BIT, Nord. Tidskr. Inf.-behandl. 18, 425-435 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68P20 Information storage and retrieval of data 68P05 Data structures 68W99 Algorithms in computer science 68Q25 Analysis of algorithms and problem complexity Keywords:Brother Trees; Search Trees; Delection Algorithms; Insertion Algorithm; Binary Trees; Computational Complexity PDFBibTeX XMLCite \textit{H. P. Kriegel} et al., BIT, Nord. Tidskr. Inf.-behandl. 18, 425--435 (1978; Zbl 0405.68054) Full Text: DOI References: [1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The design and analysis of computer algorithms, Addison-Wesley, Reading (1974). · Zbl 0326.68005 [2] D. E. Knuth,The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading (1973). · Zbl 0302.68010 [3] H. P. Kriegel, V. K. Vaishnavi, and D. Wood, 2–3brother trees, Computer Science Technical Report 78-CS-6, Department of Applied Mathematics, McMaster University, Hamilton, (1978). [4] Th. Ottmann and D. Wood, 1–2brother trees, Computer Journal (1978), to appear. [5] V. K. Vaishnavi, H. P. Kriegel, and D. Wood,Height balanced 2–3trees, Computing (1978), to appear. [6] A. C.-C. Yao,On random 2–3trees, Acta Informatica 9 (1978), 159–170. · Zbl 0369.05024 · doi:10.1007/BF00289075 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.