0% found this document useful (0 votes)

7 views

Lecture05 Tree

Uploaded by

Dheemant Rastogi

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

7 views

Lecture05 Tree

Uploaded by

Dheemant Rastogi

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 126

MH1403 Algorithms and Computing

Lecture 5 Tree

1
Outline

• Tree
• Binary tree
• Tree Traversal

2
Tree

3
Tree
• We have learned four data structures:
• Array, linked list, stack and queue
• These four data structures are linear data structure
(the data are arranged as a sequence)
• However, some data naturally comes with a
hierarchy. It is inconvenient to store and
process these data using linear data structure
• Example: files and folders in a computer system,
• Example: decision tree in machine learning
(classification trees, regression trees)

4
Tree

• Tree is a hierarchical data structure

• Tree is a collection of nodes
• The nodes are organized like an upside down tree
• Each node consists of some value, together with
some references to other nodes
• In this course, we will learn
• the general concepts and operations of tree
• the search tree (binary search tree, AVL tree)

5
Tree
• A tree data structure
stores information in
nodes root
• Similar to linked list
• There is a first node (the first
node is called root in tree)
• Each node, other than the
root, has exactly one node
pointing to it
• Different from linked list
• Each node in a tree may have
more than one references to
successors
• Each node in a linked list has
only one reference to a
successor
6
Tree
• We will learn the following concepts of tree:
• Root, internal, leaf nodes
• Parents, children, and siblings
• Paths, path length, height, and depth
• Ancestors and descendants
• Ordered and unordered trees
• Subtrees

7
Terminology: Parent

• A node is called the parent of a given node if this

node has reference pointing to that node
• Node H is the parent of Node I
• Node I is the parent of Node J, K, L
• For all nodes other than the root node, there is
one and only one parent node

8
Terminology: Child

• A node is called the child of a given node if the

given node has reference pointing to that node
• Example: Node I has three children: J, K and L
• All nodes have zero or more child nodes (children)

9
Terminology: Siblings

• Nodes with the same parent are siblings

• J, K, and L are siblings
• I and M are siblings

10
Terminology: degree

• The degree of a node is defined as the number

of its children
• Example: deg(I) = 3
deg(H) = 2

11
Terminology: leaf node, internal node

• Nodes with degree zero are called leaf nodes

• A leaf node does not point to any node
• Nodes which are not leaves are called internal
nodes

12
Leaf nodes:

13
Terminology: path

• A path is a sequence of nodes (a0, a1, ..., an),

where ak + 1 is a child of ak
• The length of this path is n
• Example, the path (B, E, G) has length 2

14
Example: Paths of length 10 (11 nodes) and 4 (5 nodes)

Start of these paths

End of these paths

15
Terminology: depth

• For each node in a tree, there exists a unique

path from the root node to that node
• The length (the number of edges) of this path is
the depth of the node
• Example: Node E has depth 2
Node L has depth 3

16
Terminology: level

• All the nodes with the same depth n are at the

same level n
• Example: Node C, E, I, M are at level 2
Node D, F, G, J, K, L are level 3

17
Nodes of depth up to 17
Level 0

Level 4

Level 9

Level 14

Level 17

18
Terminology: Height

• The height of a tree is defined as the maximum

depth of any node within the tree
• The height of a tree with one node is 0
• Note that a tree with one node contains only the root
node

19
The height of this tree is 17

20
Terminology: ancestor, descendent

• If a path exists from node a to node b:

• a is an ancestor of b
• b is a descendent of a

• Thus, a node is both an ancestor and a

descendant of itself
• We can add the adjective strict to exclude equality: a
is a strict descendent of b if a is a descendant of b
but a ≠ b

• The root node is an ancestor of all nodes

21
• The descendants of node B are B, C, D, E, F, and G:

• The ancestors of node I are I, H, and A:

22
All descendants (including itself) of the indicated node

23
All ancestors (including itself) of the indicated node

24
Terminology: subtree

• Given any node a within a tree T, the collection

of node a and all of its descendants is said to
be a subtree of the tree T

25
Binary Tree

26
Binary Tree

• In a binary tree, each node has at most two

children
• If a parent has two children, we can label the children
as left child and right child

27
Some binary tree examples with five nodes

28
Tree Traversal

29
Tree Traversal
• Tree traversal is a process to visit all the nodes of
a tree (and may print their values)
• A typical reason to traverse a tree is to display the data
stored at each node of the tree
• In this course, we learn four standard tree
traversal orderings:
• Preorder
• Inorder
• Postorder
• Level-order

30
Tree Traversal
• Depth-first traversal: go deeper in the tree before
exploring siblings
• Preorder
• Inorder
• Postorder
• Breath-first traversal: explore the breadth, i.e., full
width of the tree at a given level, before going
deeper
• Level-order
• We will learn the binary tree traversal in this course
• The traversals can be generalized to other trees
31
Traversals
A

B C

D E F G

H I

We’ll trace the different traversals using this tree; recursive calls,
returns, and “visits” will be numbered in the order they occur

32
Tree Traversal:
Depth-First Traversal

33
Preorder Traversal
• Start at the root
• Visit each node, followed by its left subtree, then right
subtree

• Recursive algorithm for preorder traversal:

• If tree is not empty,
• Visit root node of tree
• Perform preorder traversal of its left subtree
• Perform preorder traversal of its right subtree

34
Preorder Traversal
1: visit A
2 24
23 45
3: visit B 25: visit C
4 16 26 38
15 22 37 44 39:
5: visit D 17: visit E 27: visit F visit G

. . . .
6 18
. 7 14
8
19
20
9: visit H
21 28
34
35
29: visit I
36
40
41
42
43

10
. .11 12
13
30
. .31 32
33

Nodes are visited in the order ABDHECFIG

35
Preorder Traversal (to draw in lecture)

B C

D E F G

H I

36
Inorder Traversal
• Start at the root
• Visit the left subtree of each node, then the node,
then the right subtree of that node

• Recursive algorithm for inorder traversal:

• If tree is not empty,
• Perform inorder traversal of left subtree of root
• Visit root node of tree
• Perform inorder traversal of its right subtree

37
Inorder Traversal
23: visit A
1 24
22 45
14: visit B 37: visit C
2 15 25 38
13 21 36 44 41:
5: visit D 18: visit E 33: visit F
visit G

. . . .
3 16
. 4 12
6
17
19
9: visit H
20 26
32
34
29: visit I
35
39
40
42
43

7
. . 8 10
11
27
. .28 30
31

Nodes are visited in the order DHBEAIFCG

38
Inorder Traversal (to draw in lecture)

B C

D E F G

H I

39
Postorder Traversal
• Start at the root
• Visit the children of each node, then the node

• Recursive algorithm for postorder traversal

• If tree is not empty,
• Perform postorder traversal of left subtree of root
• Perform postorder traversal of right subtree of root
• Visit root node of tree

40
Postorder Traversal
45: visit A
1 23
22 44
21: visit B 43: visit C
2 14 24 36
13 20 35 42 41:
12: visit D 19: visit E 34: visit F
visit G

. . . .
3 15
. 4 11
5
16
17
10: visit H
18 25
31
32
30: visit I
33
37
38
39
40

6
. .7 8
9
26
. . 27 28
29

Nodes are visited in the order HDEBIFGCA

41
Postorder Traversal (to draw in lecture)

B C

D E F G

H I

42
Implementation of Depth-First Traversal
• Stack is needed for implementing depth-first traversal
• For example, for the tree shown below, for preorder traversal,
1) when we visit node A, before visiting its left child B, we need to
store its right child C so that we can visit C after visiting the
subtree rooted at B.
2) when visiting node B, before visiting its left child D, we need to
store its right child E
3) when visiting node D, before visiting its left child, we need to
store its right child H
4) we notice that we now stored nodes C, E, H, and we will visit
node H first, after visiting the subtree rooted at H, visit node E,
after visiting the subtree rooted at E, visit node C.
5) The node being stored most recently will be visited first (Last-
in-first-out), so stack is used

43
Implementation of Depth-First Traversal
• The simplest way to implement the depth-first
traversal is to use recursive functions
• Note that function calls are implemented using stack
(Before calling a function, the next code address is
stored on the stack. After the function call, pop the
code address from the stack and continue execution)
• An alternative way to implement the depth-first
traversal is to use the stack explicitly in the
iterative approach
• We will use preorder traversal as example to
illustrate the recursive and iterative approaches
in the following slides.
44
Example 1:
Recursive Implementation of Preorder Traversal

45
Recursive Preorder Traversal

• Recall that the preorder traversal is to:

• Start at the root
• Visit each node, followed by its left subtree, then right subtree
• The pseudo code of the recursive preorder traversal with
implicit stack is:

def preorder(root node):

if root node is not empty,
visit root node
preorder(root node’s left child)
preorder(root node’s right child)

• In the following slides, we show how this recursive function is

called to visit all the nodes in preorder
• These slides are created for you to get familiar with recursive function
46
• When writing code, we only need to call the function
preorder(), and pass node A as parameter to the function. Then
the function will call itself recursively.
preorder(A):
visit A
preorder(B)
preorder(C)

Visited nodes:
47
• Visit A

preorder(A):
visit A
preorder(B)
preorder(C)

Visited nodes: A
48
• Visit A’s left subtree rooted at B

preorder(A): preorder(B):
visit A visit B
preorder(B) preorder(D)
preorder(C) preorder(E)

Visited nodes: A
49
• Visit B

preorder(A): preorder(B):
visit A visit B
preorder(B) preorder(D)
preorder(C) preorder(E)

Visited nodes: A B
50
• Visit B’s left subtree rooted at D