UNIT 3

Syllabus: Trees- Binary Trees, Terminology, Representation, Traversals

Graphs- Terminology, Representation, Graph Traversals (DFS & BFS).

A tree is a finite set of nodes together with a finite set of directed edges (links/branches) that
define parent-child (Hierarchical) relationships.

A tree is a finite set of one or more nodes such that:

 There is a specially designated node called the root.
 Remaining nodes are partitioned into ‘n’ (n>0) disjoint sets T1, T2, ..Tn, where each
Ti
(i=1,2,….n) is a Tree, T1,T2,..Tn are called sub tree of the root.

E B

D C F H G
Tree is a non-linear data structure.

Example: Nodes = {A,B,C,D,E,F,G,H}

Edges = {(A,B),(A,E),(B,F),(B,G),(B,H),(E,C),(E,D)}

A tree satisfies the following properties:

1. It has one designated node, called the root that has no parent.
2. Every node, except the root, has exactly one parent.
3. A node may have zero or more children.
4. There is a unique directed path from the root to each node.
 5 5
5
1
3 2 3 2
2

4 1 6 4 6
1 6
Tree Not a tree Not a tree

Tree Terminology:

Root: Only node with no parent

Parent of x: The node directly above node x in the tree
Child of x: A node directly below node x in the tree
Siblings: Nodes with common parent.
Non-leaf or Internal Node: Nonleaf node.
Path: A sequence of connected nodes.
Ancestor of x: A node on the path from the root to x.
Descendent of x: A node on a path from x to a leaf.
Empty Tree: A tree with no nodes.
Leaf or External Node: A node with no children.

A
B C

D E F G H

I
The level of a node x: It is the distance from the root to node x.
Generally, the root has a zero distance from itself; the root is at level 0.
The, children of the root are at level 1, their children are at level at 2, and so on.

Height of Tree: The maximum no of nodes covered in a path starting from root node to a
leaf node is called height of a tree.

Depth: Length of the path to that node from the root.

 Degree/arity of node x: Number of children's of a node x.

A Level 0

B C Level 1

D E Level 2
F G

I Level 3
H J

Level 4
k

Binary Tree:

In a binary tree, each node has at most two sub trees.

A binary tree (T) is a finite set of nodes such that:
 T is an empty tree (called empty binary tree)
 Contains a specially designed node called the root of T, and remaining nodes of T
form two disjoint binary trees T1 and T2 which are called left sub tree and right sub tree
respectively
Note: A binary tree is a tree in which no nodes can have more than two children.

Binary Tree Properties:

1. A binary tree with n elements, n > 0, has exactly n-1 edges.

2. A binary tree of height h, h >= 0, has at least h and at most 2h-1 elements or nodes in it.
 3. The height of a binary tree that contains n elements, n >= 0, is at least (log2(n+1)) and
at most n.

Minimum and Maximum number of elements for height 4

minimum number of elements maximum number of elements

Difference between tree and binary tree:

Trees Binary tree

1) Tree never be empty. 1) Binary tree may be empty.
2) A node may have any no of nodes/children’s. 2) A node may have at most
2 children's or 0 or1 children.

Full Binary Tree:

 A full binary tree is a tree in which every node other than the leaves has two children.
Note: All leaves are at same level and all other nodes each have two children.
A full binary tree of height h has exactly 2h-1 nodes.

1 Level 0- 1node

2 3 Level 1- 2nodes

4 5 6 7 Level 2- 4nodes

10 12 13 14 15 Level 3-8nodes
8 9 11

Complete Binary Tree:

  A complete binary tree is a binary tree in which every level is completely
filled except possibly the last level.
 In the unfilled level, the nodes are attached starting from the left-most position.
1 Level 0- 1node

2 3 Level 1- 2 nodes

4 5 6 7 Level 2- 4 nodes

8 9 Level 3- 2 nodes

Balanced Binary Tree:

 Balanced binary tree is a binary tree in which the left and right sub trees height
must be differed by at most 1.
1

2 3 Left sub tree height = 3

Right sub tree height = 2
4 5 6 7

Difference = 1
8 9
Left skewed binary tree: If the right sub tree is missing in every node of tree then we
call it as left skewed tree.
A
B
C
Right skewed binary tree: If the left sub tree is missing in every node of a tree then we
call it is right sub tree.
 A4
B
C
3
Representation of a Binary Tree using Array:
 Sequential Representation :
 Tree nodes are stored in a linear data structure like array.
 Root node is stored at index ‘0’
 If a node is at a location ‘i’, then its left child is located at 2 * i + 1 and
right child is located at 2 * i + 2.
 The space required by a binary tree of height h is 2h-1.
Example: Sequential representation
0
A

1 2
B D

3
5 G 6
C E

F 12

A B D C . E G . . . . . F

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Advantages of array/sequential/static representation

 Any node can be accessed from any other node by calculating the index and this is
efficient from execution point of view.
 There is no overhead of maintaining the pointers.
Disadvantages of Static Representation
 The major disadvantage with this type of representation is wastage of memory. Example:
In the skewed tree, half of the array is unutilized.
 Allows only static representation. There is no possible way to enhance the size of the
tree.
 Inserting a new node and deleting a node from it are inefficient with this representation
because these require considerable data movement up and down the array which demands
excessive processing time.
Representation of Binary Tree using Linked List:
 The most popular way to present a binary tree.
 Each element is represented by a node that has two link fields (leftChild and
rightChild) plus an element field.
 The space required by an n node binary tree is n * sizeof a node.
 Linked Representation of Binary Tree

29

Advantages of linked representation:

 This representation is superior to the array representation as there is no wastage of
memory.
 There is no need to have prior knowledge of depth of the tree. Using dynamic memory
allocation concept one can create as much memory (node) as required.
 Insertion and deletion which are the most common operations can be done without
moving the other nodes.
Disadvantages of linked representation:
 This representation does not provide direct access to a node.
 It needs additional space in each node for storing the left and right subtrees.
Binary Tree Traversal Techniques:
 There are three recursive techniques for binary tree traversal.
1. Preorder Traversal
2. Inorder Traversal
3. Postorder Traversal

1. Preorder Traversal:

Algorithm preOrder (root)

Traverse a binary tree in root-left-right
Pre Condition: root is the entry node of a tree or subtree
Post Condition: each node has been processed in order
1. if(root is not null)
1. process(root)
2. preOrder(leftsubtree)
3. preOrder(rightsubtree)
2. end if
end preOrder

2. Inorder Traversal:

Algorithm inOrder (root)

Traverse a binary tree in left-root-right
Pre Condition: root is the entry node of a tree or subtree
Post Condition: each node has been processed in order
1. if(root is not null)
1. inOrder(leftsubtree)
2. process(root)
3. inOrder(rightsubtree)
2. end if
end inOrder

3. Postorder Traversal:

Algorithm postOrder (root)

Traverse a binary tree in left-right-root
Pre Condition: root is the entry node of a tree or subtree
Post Condition: each node has been processed in order
1. if(root is not null)
1. postOrder(leftsubtree)
2. postOrder(rightsubtree)
3. process(root)
2. end if
end postorder

Example: Write the pre-order, in-order, post-order traversals for the following graph.

Preorder: A B D E H I C F J K G
Inorder: D B H E I A F K J C G
Postorder: D H I E B K J F G C A

Applications of Trees:
Trees are very important data structures in computing.
They are suitable for:
– Hierarchical structure representation, e.g.,
• File directory.
• Organizational structure of an institution.
• Class inheritance tree.
– Problem representation, e.g.,
• Expression tree.
• Decision tree.
– Efficient algorithmic solutions, e.g.,
• Search trees.
• Efficient priority queues via heaps.