Authors: Jinsheng Yang, Genhu Li

1
Graphical Demonstration AVL TREE
Authors Jinsheng Yang,
Genhu Li and Xiuwen Zhang
October, 1999
2

• REVIEW
• An AVL tree is a binary search tree of which
  every internal node is balanced.
• A node is balanced if the heights of the
  children differ by at most one.
• Advantage of AVL tree
• All of the operations on an AVL tree are of
  O(log n)

3
Functionality

• Basic AVL Tree Operations
• Insert Node
• Remove Node
• Search for Node
• Modes of Tree Node Generation
• Randomly generate tree node
• Generate tree node by user
• Demonstration
• Non-stop demo
• Step by step demo

4
GUI of the Project
Generate Tree
9
Tree size
7
23
Enter key here
17
5
Insert
Remove
Search
30
3
6
13
unbalanced
Status
26
14
42
Undo
Restructure
23
Print
Moregtgt
5
Functionality

• Restructure
• Perform single or double rotation as required
• Undo
• One click undoes one operation
• Multiple clicks undo multiple operations
• Rotation Information
• Distinguish single or double rotation
• Controllable Animation Speed

6
GUI of the Project (continued)
23
Enter key here
Insert
Insert
Insert
unbalanced
Status
Undo
Restructure
Single rotation
Anim Speed
Code
More Window
Moregtgt
Zoom in
Zoom out
7
Functionality

• Zoom in/Zoom out
• Get magnified view of part of tree, which is
  convenient when the size of tree is large
• Multiple Trees Comparison
• Show the snapshot of trees at different stages of
  build-up
• Options for Animation Schemes
• Co-display of Source Code
• Multiple Windows Extends Functions

8
GUI of the Project (continued)
23
Enter key here
Insert
Insert
Insert
unbalanced
Status
Undo
Restructure
Single rotation
Anim Speed
Code
More Window
Moregtgt
Zoom in
Zoom out
9
CONCLUSION

• The project will help students understand AVL
  trees.
• May be extended to show other tree structures.
• Useful in debugging.

10
Graphical Demonstration AVL Tree

• Mahalo