dataStructures
Interface BinaryTree

All Known Implementing Classes:
LinkedBinaryTree

public abstract interface BinaryTree


Method Summary
 void inOrder(java.lang.reflect.Method visit)
           
 boolean isEmpty()
           
 void levelOrder(java.lang.reflect.Method visit)
           
 void makeTree(java.lang.Object root, java.lang.Object left, java.lang.Object right)
           
 void postOrder(java.lang.reflect.Method visit)
           
 void preOrder(java.lang.reflect.Method visit)
           
 BinaryTree removeLeftSubtree()
           
 BinaryTree removeRightSubtree()
           
 java.lang.Object root()
           
 

Method Detail

isEmpty

public boolean isEmpty()

root

public java.lang.Object root()

makeTree

public void makeTree(java.lang.Object root,
                     java.lang.Object left,
                     java.lang.Object right)

removeLeftSubtree

public BinaryTree removeLeftSubtree()

removeRightSubtree

public BinaryTree removeRightSubtree()

preOrder

public void preOrder(java.lang.reflect.Method visit)

inOrder

public void inOrder(java.lang.reflect.Method visit)

postOrder

public void postOrder(java.lang.reflect.Method visit)

levelOrder

public void levelOrder(java.lang.reflect.Method visit)