Binary Search Tree Program
Nodes are inserted into and removed from a binary search tree.
-
Each node contains a key value and a data value.
-
A binary search tree is constructed based on the key values of the nodes.
-
The key values of the nodes in the left subtree of a node are smaller
than the key value of that node.
-
The key values of the nodes in the right subtree of a node are larger
than the key value of that node.
Source Code of the SearchTreeG Program (Graphical Version)
Jacob's CS 261 Demos
Jacob's CS 261 Home