"AVLTree" (Data Structure)

"AVLTree"

represents a mutable, self-balancing binary search tree, where the values stored at each node are general expressions.

Details

  • A binary search tree stores data in a sorted form that allows quick insertion operations. A self-balancing binary search tree makes sure that the heights of all branches are balanced; this helps operations to be efficient despite arbitrary insertions and deletions.
  • CreateDataStructure[ "AVLTree"]create a new empty "AVLTree"
    CreateDataStructure["AVLTree",v{l,r}]create a new "AVLTree" with specified initial value v and specified left and right children
    Typed[x,"AVLTree"]give x the type "AVLTree"
  • For a data structure of type "AVLTree", the following operations can be used:
  • ds["BreadthFirstScan",f]perform a breadth-first scan of ds, passing the data in each node to ftime: O(n)
    ds["EmptyQ"]True, if ds has no nodestime: O(1)
    ds["FreeQ",x]True, if ds does not contain xtime: O(log n)
    ds["InOrderScan",f]perform an in-order scan of ds, passing the data in each node to ftime: O(n)
    ds["Insert",x]insert x into dstime: O(log n)
    ds["Length"]the number of nodes in dstime: O(1)
    ds["MemberQ",x]True, if ds contains xtime: O(log n)
    ds["PostOrderScan",f]perform a post-order scan of ds, passing the data in each node to ftime: O(n)
    ds["PreOrderScan",f]perform a pre-order scan of ds, passing the data in each node to ftime: O(n)
    ds["Remove",x]remove x from dstime: O(log n)
    ds["Visualization"]return a visualization of dstime: O(n)
  • The following functions are also supported:
  • dsi===dsjTrue, if dsi equals dsj
    FullForm[ds]the full form of ds
    Information[ds]information about ds
    InputForm[ds]the input form of ds
    Normal[ds]convert ds to a normal expression
  • The order of two elements is determined by the Order function.
  • The "AVLTree" maintains a balanced property that the height of each subtree never differs by more than 1.

Examples

open allclose all

Basic Examples  (1)

A new "AVLTree" can be created with CreateDataStructure:

Insert a number of values:

A visualization of the data structure can be generated:

Scope  (3)

Information  (1)

A new "AVLTree" can be created with CreateDataStructure:

Information about the data structure ds:

Balancing  (1)

"AVLTree" maintains a balance where the height of each subtree never differs by more than 1:

A modification that would break the balanced property causes rebalancing:

Now an insertion on the right does not require rebalancing:

Removing from the left requires rebalancing:

Ordering  (1)

Create a new tree and insert 30 random numbers:

This makes an in-order scan over the tree. Since it is sorted, the elements are visited in sorted order, as shown in this example:

Introduced in 2020
 (12.1)