Class AATree

java.lang.Object
edu.ksu.cis.viewer.AATree
All Implemented Interfaces:
BSTInterface, Serializable

public final class AATree extends Object implements BSTInterface
An immutable AA tree that can draw itself. An AA tree is a binary search tree in which each node has a level and a color, either red or black. The level of any leaf is 1, and the level of any non-leaf is one greater than the level of its left child (if it has one), and either equal to or one greater than the level of its right child (if it has one). A node is considered to be red if it has the same level as its parent; otherwise, it is considered to be black (the root is always black). The parent of a red node must always be black.
Author:
Stella Houston and Rod Howell (rhowell@ksu.edu)
See Also:
  • Constructor Details

    • AATree

      public AATree()
      Constructs an empty AA Tree.
  • Method Details