DocumentCode
2546307
Title
Binary search tree visualization algorithm
Author
Borovskiy, Vadym ; Müller, Jüller ; Schapranow, Matthieu-Patrick ; Zeier, Alexander
Author_Institution
Hasso Plattner Inst. for Software Syst. Eng., Potsdam, Germany
fYear
2009
fDate
21-23 Oct. 2009
Firstpage
108
Lastpage
112
Abstract
Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a tree in time linearly proportional to the number of nodes in a tree.
Keywords
data visualisation; tree data structures; tree searching; trees (mathematics); BST visualization algorithms; binary search tree; data structure; tree visualization algorithm; Algorithm design and analysis; Binary search trees; Data engineering; Data structures; Data visualization; Programming profession; Software algorithms; Software systems; Tree data structures; Tree graphs; Binary Search Tree; Tree Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management, 2009. IE&EM '09. 16th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-3671-2
Electronic_ISBN
978-1-4244-3672-9
Type
conf
DOI
10.1109/ICIEEM.2009.5344285
Filename
5344285
Link To Document