Basic Terminologies of Tree and Tree Traversal methods.pptx

Trees - Introduction
 All previous data organizations we've studied
are linear—each element can have only one
predecessor and successor
 Accessing all elements in a linear sequence is
O(n)
 Trees are nonlinear and hierarchical
 Tree nodes can have multiple successors (but
only one predecessor)

Trees - Introduction (cont.)
 Trees can represent hierarchical organizations
of information:
 class hierarchy
 disk directory and subdirectories
 family tree
 Trees are recursive data structures because
they can be defined recursively
 Many methods to process trees are written
recursively

Tree Terminology and
Applications

Tree Terminology
dog
cat wolf
canine
A tree consists of a collection of elements or
nodes, with each node linked to its successors

Tree Terminology (cont.)
dog
cat wolf
canine
The node at the top
of a tree is called its
root

dog
cat wolf
canine
The links from a
node to its
successors are
called branches

dog
cat wolf
canine
The successors of a
node are called its
children

dog
cat wolf
canine
The predecessor of
a node is called its
parent

dog
cat wolf
canine
Each node in a tree
has exactly one parent
except for the root
node, which has no
parent

dog
cat wolf
canine
Nodes that have the
same parent are
siblings

dog
cat wolf
canine
A tree consists of a collection of elements or nodes,
with each node linked to its successors
A node that has no
children is called a
leaf node

dog
cat wolf
canine
A node that has no
children is called a
leaf node
Leaf nodes also are
known as
external nodes,
and nonleaf nodes
are known as
internal nodes

dog
cat wolf
canine
A generalization of the parent-child
relationship is the
ancestor-descendant relationship

dog
cat wolf
canine
dog is the parent
of cat in this tree
relationship is the

dog
cat wolf
canine
cat is the parent
of canine in this
tree
relationship is the

dog
cat wolf
canine
canine is a
descendant of cat
in this tree
relationship is the

dog
cat wolf
canine
dog is an
ancestor of
canine in this tree
relationship is the

dog
cat wolf
canine
A subtree of a node
is a tree whose root
is a child of that
node

dog
cat wolf
canine
The level of a node
is determined by its
distance from the
root

dog
cat wolf
canine
The level of a node
is its distance from
the root plus 1
Level 1
Level 2
Level 3

dog
cat wolf
canine
The level of a node
is defined
recursively
Level 1
Level 2
Level 3

dog
cat wolf
canine
The level of a node
is defined
recursively
Level 1
Level 2
Level 3
• If node n is the root of tree T, its level is 1
• If node n is not the root of tree T, its level is
1 + the level of its parent
Level 0
Level 1
Level 2

dog
cat wolf
canine
The height of a
node is the
number of edges
from the node to
the deepest leaf
(ie. the longest
path from the
node to a leaf
node).

dog
cat wolf
canine
The height of
this tree is 2
The height of a
node is the
number of edges
from the node to
the deepest leaf
(ie. the longest
path from the
node to a leaf
node).

Binary Trees
 A tree whose elements have at most 2 children
is called a binary tree.
 A set of nodes T is a binary tree if either of the
following is true
 T is empty
 Its root node has two subtrees, TL and TR, such
that TL and TR are binary trees
(TL = left subtree; TR = right subtree)

Expression Tree
 Each node contains an
operator or an operand
 Operands are stored in
leaf nodes
 Parentheses are not stored
in the tree because the tree structure dictates
the order of operand evaluation
 Operators in nodes at higher tree levels are
evaluated after operators in nodes at lower
tree levels
(x + y) * ((a + b) / c)

Huffman Tree
 A Huffman tree represents Huffman codes for
characters that might appear in a text file
 As opposed to ASCII or Unicode, Huffman
code uses different numbers of bits to encode
letters; more common characters use fewer
bits
 Many programs that compress files use
Huffman codes

Huffman Tree (cont.)
To form a code, traverse the tree from the
root to the chosen character, appending 0
if you branch left, and 1 if you branch
right.

Huffman Tree (cont.)
Examples:
d : 10110
e : 010

Binary Search Tree
 Binary search trees
 All elements in the left subtree
precede those in the right subtree
 A formal definition:
A set of nodes T is a binary
search tree if either of the following is true:
 T is empty
 If T is not empty, its root node has two subtrees, TL
and TR, such that TL and TR are binary search trees
and the value in the root node of T is greater than all
values in TL and is less than all values in TR

Binary Search Tree (cont.)
 When searching a BST, each probe has the
potential to eliminate half the elements in the
tree, so searching can be O(log n)
 In the worst case, searching is O(n)

Recursive Algorithm for
Searching a Binary Tree
1. if the tree is empty
2. return null (target is not found)
else if the target matches the root node's data
3. return the data stored at the root node
else if the target is less than the root node's data
4. return the result of searching the left subtree of the
root
else
5. return the result of searching the right subtree of the
root

Full, Perfect, and Complete
Binary Trees
 A full binary tree is a
binary tree where all
nodes have either 2
children or 0 children
(the leaf nodes)
7
10
1
12
9
3
0
5
2 11
6
4
13

Binary Trees (cont.)
 A perfect binary tree is
a full binary tree of
height n with exactly
2n+1 – 1 nodes
 In this case, n = 2 and
2n+1 – 1 = 7
3
1
4
2
0
5
6

Binary Trees (cont.)
 A complete binary tree
is a perfect binary tree
through level n - 1 with
some extra leaf nodes
at level n (the tree
height), all toward the
left.
 A Binary Tree is a
complete Binary Tree if
all the levels are
completely filled except
possibly the last level
and the last level has all
keys as left as possible
3
1
4
2
0
5

Tree Traversals
 Often we want to determine the nodes of a
tree and their relationship
 We can do this by walking through the tree in a
prescribed order and visiting the nodes as they
are encountered
 This process is called tree traversal
 Three common kinds of tree traversal
 Inorder
 Preorder
 Postorder

Tree Traversals (cont.)
 Preorder: visit root node, traverse TL, traverse
TR
 Inorder: traverse TL, visit root node, traverse TR
 Postorder: traverse TL, traverse TR, visit root
node

Visualizing Tree Traversals
 You can visualize a tree
traversal by imagining a
mouse that walks along the
edge of the tree
 If the mouse always keeps
the tree to the left, it will
trace a route known as the
Euler tour
 The Euler tour is the path
traced in blue in the figure
on the right

(cont.)
 If we record a node as
the mouse visits each
node before traversing its
subtrees (shown by the
downward pointing
arrows) we get a preorder
traversal
 The sequence in this
example is
a b d g e h c f i j

(cont.)
 If we record a node as
the mouse returns from
traversing its left subtree
(shown by horizontal
black arrows in the figure)
we get an inorder
traversal
 The sequence is
d g b h e a i f j c

(cont.)
 If we record each node
as the mouse last
encounters it, we get a
postorder traversal
(shown by the upward
pointing arrows)
 The sequence is
g d h e b i j f c a

Traversals of Binary Search
Trees and Expression Trees
 An inorder traversal of a
binary search tree results
in the nodes being visited
in sequence by
increasing data value
canine, cat, dog, wolf
dog
cat wolf
canine

Traversals of Binary Search Trees
and Expression Trees (cont.)
 An inorder traversal of an
expression tree results in the
sequence
x + y * a + b / c
 If we insert parentheses
where they belong, we get
the infix form:
(x + y) * ((a + b) / c)
*
/
+
c
+
y
x
b
a

 A postorder traversal of an
sequence
x y + a b + c / *
 This is the postfix or reverse
polish form of the expression
 Operators follow operands
*
/
+
c
+
y
x
b
a

 A preorder traversal of an
sequence
* + x y / + a b c
 This is the prefix or forward
polish form of the expression
 Operators precede operands
*
/
+
c
+
y
x
b
a

BINARY SEARCH TREE
A running demonstration of binary search data structure and
algorithms

Insert
First value is the 'Root' of the tree.
87

Insert
87
Since 50 is Less than 87, we move to the left sub-tree
**Since no sub-tree, 50 is now added as the left leaf**
50

Insert
87
50
27

Insert
87
50
27
Since 111 is Greater than 87, we move to the right sub-tree
**Since no sub-tree, 111 is now added as the right leaf**
111

Insert
87
50
27
111
99

Insert
87
50
27
111
99
42

Insert
87
50
27
111
99
42
90

Insert
87
50
27
111
99
42 90
105

Insert
87
50
27
111
99
42 90 105
58

Insert
87
50
27
111
99
42 90 105
58
32

Insert
87
50
27
111
99
42 90 105
58
32
68

Insert
87
50
27
111
99
42 90 105
58
32
68
43

Insert
87
50
27
111
99
42 90 105
58
32
68
43
60

Insert
87
50
27
111
99
42 90 105
58
32
68
43 60
70

Insert
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51

Insert
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51
1

Insert
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51
1
11

Predecessor
The node to delete is 50
Predecessor is found by finding the right most node of the 50 nodes left sub-tree
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51
1
11

Sucsessor
Successor is found by finding the left most node of the 50
nodes right sub-tree
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51
1
11

How to delete 50?
There is a left child so we find predecessor
To learn more about finding predecessor insert
<Fpred>starting value</Fpred> to data file
87
50
27
111
99
42 90 105
58
32
68
43 60 70
51
1
11

Delete
This is how the new tree would appear
87
43
27
1
11
42
32
58
51 68
60 70
111
99
90 105

How to delete 105?
This is a Leaf case
We just remove this node from the tree
87
43
27
1
11
42
32
58
51 68
60 70
111
99
90 105

Delete
This is a Leaf case
87
43
27
1
11
42
32
58
51 68
60 70
111
99
90

How to delete 87?
To learn more about finding predicessor insert
<Fpred>starting value</Fpred> to data file
87
43
27
1
11
42
32
58
51 68
60 70
111
99
90

Delete
70
43
27
1
11
42
32
58
51 68
60
111
99
90

How to delete 111?
There is only one child, so replace the node with its only child
70
43
27
1
11
42
32
58
51 68
60
111
99
90

After 111 is replaced by its only child
There is only one child, so replace the node with its only child
70
43
27
1
11
42
32
58
51 68
60
99
90

70
43
27
1
11
42
32
58
51 68
60
111
99
90
PreOrder Traversal
1.Visit the root
2.Visit the left sub-tree
3.Visit the right sub-tree

70
43
27
1
11
42
32
58
51 68
60
111
99
90
InOrder Traversal
2.Visit the root

70
43
27
1
11
42
32
58
51 68
60
111
99
90
PostOrder Traversal
3.Visit the root

Basic Terminologies of Tree and Tree Traversal methods.pptx

More Related Content

Similar to Basic Terminologies of Tree and Tree Traversal methods.pptx (20)

Recently uploaded (20)

Basic Terminologies of Tree and Tree Traversal methods.pptx