edu.govschool.midterm.problem2

Class Tree

java.lang.Object

edu.govschool.midterm.problem2.Tree

public class Tree
extends java.lang.Object

Representation of the binary search tree data structure.

Constructor Summary

Constructors

Constructor and Description
Tree() Empty constructor.
Tree(Node root) Default constructor.

Method Summary

Modifier and Type	Method and Description
Node	getRoot() Returns the root of the Tree.
void	insert(int data) Inserts some data into the Tree.
boolean	isEmpty() Tests if the Tree is empty.
void	print() Prints the Tree.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Tree

public Tree()

Empty constructor. Creates a Tree with an empty root

Tree

public Tree(Node root)

Default constructor. Creates a Tree with the specified Node as the root

Method Detail

getRoot

public Node getRoot()

Returns the root of the Tree.

Returns:

the root

isEmpty

public boolean isEmpty()

Tests if the Tree is empty.

Returns:

true if the root is null

insert

public void insert(int data)

Inserts some data into the Tree. We traverse down the Tree recursively following the rules of a BST.

Parameters:

data - the data to insert

print

public void print()

Prints the Tree. First, the right sub-tree of the current Node is output, then the Node itself, then the left sub-tree, recursively!