This preview shows page 1. Sign up to view the full content.
Binary tree
A
container object with a
unique starting node
called the
root
, in which
each node is capable of
having two child nodes,
and in which a unique
path exists from the root
to every other node
Root
The top node of a
tree structure; a node
with no parent
Leaf node
A tree node
that has no children
302
Chapter 9
Abstract Data Types and Algorithms
Figure 9.16
A binary tree
1
2
4
7
3
56
81
0
9
tree
Binary Trees
The vocabulary of trees uses the same vocabulary that we introduced in
relation to the linked implementation. Every position in the tree is a
node
,
which contains both the user’s data and information on where to go to get
the next node.
From the computing perspective a
binary tree
is a container object in
which each node is capable of having two successor nodes, called
children
.
Each of the children, being nodes in the binary tree, can also have up to
two child nodes, and these children can also have up to two children, and
so on, giving the tree its branching structure. The beginning of the tree is a
This is the end of the preview. Sign up
to
access the rest of the document.
 Fall '10
 MARIANAKANT

Click to edit the document details