Discuss B-Trees
•Remember in a binary
search tree,
–if a node has 2
children then it contains one data value (i.e.,
one value).
–You can think of the
data value at a node as separating the data
values in the two child subtrees.
–All keys to the left
are less than the node's data value and all
key values to the right are greater than or equal.
–The value of the data
at a particular node tells you which branch to
take.