public class BinaryTree<T>
extends java.lang.Object
Constructor and Description |
---|
BinaryTree()
Instantiate an empty tree.
|
BinaryTree(BinaryTree<T> bt) |
BinaryTree(T data,
BinaryTree<T> left,
BinaryTree<T> right)
Instantiate a binary tree where data will be stored in the root node and
its left child is binary tree left and right child is binary tree right.
|
Modifier and Type | Method and Description |
---|---|
boolean |
equals(java.lang.Object o) |
boolean |
find(T key) |
BinaryTree<T> |
getLeft() |
BinaryTree<T> |
getRight() |
T |
getRootData() |
int |
height() |
java.lang.String |
inOrderTraverse() |
java.lang.String |
postOrderTraverse() |
java.lang.String |
preOrderTraverse() |
int |
size() |
public BinaryTree()
public BinaryTree(T data, BinaryTree<T> left, BinaryTree<T> right)
data
- is the data to be stored in the root.left
- is the left child.right
- is the right child.public BinaryTree(BinaryTree<T> bt)
public boolean find(T key)
key
- is an object T to search for.public T getRootData()
java.util.NoSuchElementException
- if this is an empty tree,public BinaryTree<T> getLeft()
java.util.NoSuchElementException
- if this tree is empty.public BinaryTree<T> getRight()
java.util.NoSuchElementException
- will be thrown, if this tree is empty.public int size()
public java.lang.String preOrderTraverse()
public java.lang.String postOrderTraverse()
public java.lang.String inOrderTraverse()
public boolean equals(java.lang.Object o)
equals
in class java.lang.Object
public int height()