Binary Search Tree Visualization Algorithm

摘要：

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.

关键词： Binary Search Tree Tree Visualization

作者: Vadym Borovskiy Jüller Müller Matthieu-Patrick Schapranow Alexander Zeier

作者单位: Hasso Plattner Institute for Software Systems Engineering

会议类型: 国际会议

会议名称: 2009 IEEE 16th International Conference on Industrial Engineering and Engineering Management(IEEE第16届工业工程与工程管理国际学术会议)

会议地点: 北京

会议语种:英文

页码: 1953-1957

在线出版日期: 2009-10-21（万方平台首次上网日期，不代表论文的发表时间）