Skip to content

An animated demonstration of balanced BST and Btree, support AVL, Treap, BST, B tree

Notifications You must be signed in to change notification settings

jianhe25/Balanced-BST-and-Btree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 

Repository files navigation

Overview

This is a self balanced tree and B tree demonstration system. The system can be used as a demonstration tool for data structure course, it supports following trees:

  • BST
  • Treap
  • AVL tree
  • B tree

All of these trees are represented by a graphical interface, I use circles with a number to denote node, and straight line to denote branches.

AVL tree

AVL tree

Btree

Btree

The system also supports the efficiency comparison of different trees, displayed with histogram.

Time Comparison when inserts 2000 numbers.

Statistics This is my data structure course project in 2011.

About

An animated demonstration of balanced BST and Btree, support AVL, Treap, BST, B tree

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published