Balanced Binary Tree Adjustment Algorithm Visualization Teaching Research and Practice

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.