AVL TREE

This is a demo of AVL tree - balanced binary search tree.

Visualisation by Cytoscape.js

AVL Tree

Source Array:

Insertion:

Deletion:

Search:

EXAMPLES

  1. Enter the source array, the default root of the binary search tree is the first number in the source array.
  2. Select the type for Binary Search Tree
  3. Build your Binary Search Tree

Note: There is no duplicate node allowed in this demo.