A binary tree is either an empty set of nodes or a set of nodes with one node designated as the root. Each node has two subtrees, the left subtree and right subtree descending from it.
The binary search tree is an ordered binary tree in which each node contains an item, in which all items in the left subtree precede the root item, and the root item precedes all the items in the right subtree.
For example:
----------------|melon|----------------
----------------/-----\----------------
---------|apple|-------|orange|--------
---------/-----\-------/------\--------
----|NULL|--|lemon|--|NULL|--|pear|----
Lemon is less than melon, but greater than apple. And pear is greater than lemon and greater than orange.
To make the tree you would need functions to:
-Initialize the tree to empty
-Determine whether the tree is empty
-Determine whether the tree is full
-Determine the number of items in the tree
-Add an item to the tree
-Delete an item from the tree
-Search the tree for an item
-Visit each item of in the tree
Well that's about it. Need anything else just ask.
