36
-
Leave:
node
with
no
children or
descendants. Unlike
root,
it
is
categorized as
child by default because of its depth.
-
Height: the maximum number of depth available within a tree.
There
are
varies
type
of
tree’s
data
structure,
in
which
binary
tree
and
general
tree
as
two of the most generic types among the others. Binary Tree is a tree with one root
node
and every node in a tree can have only two child or sub-nodes. On the contrary,
general
tree is a tree that have one root node and ‘n’
number of sub-nodes (child and
leaves), in
which ‘n’
is not limited to any number. Observe figure 2.1.2.6.a.
This
figure
illustrates
a
tree
that
has
total
of
seven
nodes
that
is
indicated with
first
seven
alphabets (a
-
g).
Node ‘a’ acts as root, while
node ‘b’ and
‘c’ serves as
root’s child or sub-node, and
last
four nodes (d, e, f ,g) are the leaves of this tree. Examining through each depth,
it can be
noticed that there
is one
factor that determine the type of the tree presented below, which
is the number of node b’s child or the leaves
from node ‘b’. These three nodes or leaves
denote the
tree presented below
is
a
general
tree
and
not
binary tree, because they don’t
fulfill
the
requirement
of
binary
tree
which
accepts
the
maximal
of
two
nodes
or
child
for every nodes in the tree.
 |