BST

Class BST

java.lang.Object
  BST

A binary search tree for Strings.

Constructor Summary
`BST()` Constructs an empty binary search tree.

Method Summary
`void`	`clear()` Makes the tree empty.
`boolean`	`contains(String item)` Searches for an item in the tree.
`int`	`count()` Counts the items.
`boolean`	`delete(String item)` Deletes item from the tree.
`int`	`depth(String item)` Finds an item's depth in the tree.
`int`	`height()` Finds the height of the tree.
`String`	`inOrder()` Returns in-order tree contents.
`boolean`	`insert(String item)` Inserts an item in the tree.
`boolean`	`isEmpty()` Returns true if the tree is empty.
`String`	`postOrder()` Returns post-order tree contents.
`String`	`preOrder()` Returns pre-order tree contents.

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail

public BST()

Constructs an empty binary search tree.

Method Detail

public boolean isEmpty()

Returns true if the tree is empty.

public void clear()

Makes the tree empty.

public boolean contains(String item)

Searches for an item in the tree.

public int depth(String item)

Finds an item's depth in the tree.

Parameters:: item - the item to find.
Returns:: -1 if item is not in the tree, 0 if item is in the root, or number of depths below root otherwise.

public int height()

Finds the height of the tree.

public int count()

Counts the items.

public String inOrder()

Returns in-order tree contents.

public String preOrder()

Returns pre-order tree contents.

public String postOrder()

Returns post-order tree contents.

public boolean insert(String item)

Inserts an item in the tree. Does nothing if a duplicate item is already in the tree.

public boolean delete(String item)

Deletes item from the tree. Does nothing if item is not in the tree.