I have been looking at code associated with sorted Binary Trees and have a question.
In every example I have found the Node is represented either by an integer number or an alphabetic letter.
The descriptions of the code use the node values to decide if the children go to the left or right.
(Alignment may not be perfect)
/ \ /\
13 22 27 30
/ \ /
5 9 17
/ \ / \
D E F G
Where left or right points to next Node or a 'null' pointer value
Here are the questions I have based upon my review of the information I have found:
a. Do the Node values represent numeric entries like 'employee ID' or 'SSN' values?
or b. Do the Node values represent name entries like 'last name' or 'product' values?
Do you think of the Node value as a key to additional information associated with the node?
For example, should the Node represent a key to an object with associated information for the key?
Are the node values ever mixed, such that both numbers and letters are used as Node values
in the same object, or are they exclusive as in numbers only and letters only?
What are some typical Node assignments for a typical Binary Search database?
Where is the practical information stored in a typical application?
Just single numbers/letters Node look-ups don't seem to have much practical use.
I seem to have a missing link in my understanding of the structure and use of the Binary Tree.
Any information or links to help enlighten me would be much appreciated.