The following object diagrams provide the foundation for a BST.

We would then incorporarte the "how" concepts to develop the object behaviors (i.e., methods).

BST Object Diagram
The root designates the root node of the tree.

For the sortFct and searchFct, see sort and search functions
BST
  |
  +------- root ------- a BSTNode
  |
  +------- sortFct ------- a function used for inserting/sorting
  |
  +------- searchFct ------- a function used for searching
BSTNode Object Diagram
What would we fill "????" in with?





BSTNode
  |
  +------- data ------- type varies
  |
+------- ???? ------- a ???? | +------- ???? ------- a ????
+------- left ------- a BSTNode<T> | +------- right ------- a BSTNode<T>