Balanced Binary Tree Adjustment Algorithm Visualization Teaching Research and Practice

Article Preview

Abstract:

Data structure teaching difficulty is not to show a variety of data structures and algorithms of dynamic process. Balanced binary tree insert and delete balance adjustment process is also so. In order to show the dynamic rebalancing process, by using object oriented method to achieve AVL tree visualization. On the left side of the window shows the minimum unbalanced subtree dynamic adjustment algorithm, on the right side real-time call in relative rebalancing graphic, and at each node upper real-time display every subtree's balance factor, shows various shapes balance binary tree insert and delete operation of all balance adjustment.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2813-2817

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Rock S J, Wozny M J. Generating topological information from a"bucket of facets"[A]. HL Marcus. Solid Freeform Fabrication Symposium Proceedings [C]. Austin: University of Texas, 1992: 251-259.

Google Scholar

[2] Zhujun. Adaptive rapid RP - CAPP system research. Tsinghua University, 1999. 66-67.

Google Scholar

[3] Xiaodong Wang, Data structure in C++: Science press, 2008, in Chinese.

Google Scholar

[4] Yangxiaobo, Chenbangze, isualization of binary tree implementation . Software, 2011, (12): 24-28.

Google Scholar

[5] Sunaidong, Yangqiumei, Xiaomeiyan"Data structure" balanced binary tree method of teaching research . hina's science and education innovation Tribune , 2009, 22: 66-67.

Google Scholar

[6] Weimin Yan, Weimin Wu, Data structure in C: Tsinghua University press, 2007, in Chinese.

Google Scholar