Binary Tree

Storing Data in a Tree
Consider a scenario where you are required to represent the directory

structure of your operating system.
The directory structure contains various folders and files. A folder may
further contain any number of sub folders and files.
In such a case, it is not possible to represent the structure linearly
because all the items have a hierarchical relationship among
themselves.
In such a case, it would be good if you have a data structure that
enables you to store your data in a nonlinear fashion.
Directory structure
Defining Trees
Trees are used in applications in which the relation between data elements
needs to be represented in a hierarchy.
A tree is a nonlinear data structure that represent a hierarchical relationship
among the various data elements
B C D
E F G H I J K
L M
Defining Trees (Contd.)
Each element in a tree is referred to as a node.

The topmost node in a tree is called root.
root
B C D
E F G H I J K
L M node
Defining Trees (Contd.)
Each node in a tree can further have subtrees below its

hierarchy.
root
B C D
E F G H I J K
L M node
 A tree is a collection of nodes connected by edges
 A node contains
 Data (e.g. an Object)
 References (edges) to two or more subtrees or
children
 Trees are hierarchical
 A node is said to be the parent of its children
(subtrees)
 There is a single unique root node that has no
parent
 Nodes with no children are called leaf nodes
 A tree with no nodes is said to be empty
Tree Terminology
Leaf node: It refers to a node with no children.

Let us discuss various terms that are most frequently used
with trees.
A
Nodes E, F, G, H, I, J, L,
and M are leaf nodes.
B C D
E F G H I J K
L M
Tree Terminology (Contd.)
Children of a node: The roots of the subtrees of a node are

called the children of the node.
Subtree: A portion of a tree, which can be viewed as a
separate tree in itself is called a subtree.
A subtree can also contain just one node called the leaf node.
A
Tree with root B,
containing nodes E, F,
B C D G, and H is a subtree of
node A.
E F G H I J K
L M
E, F, G, and H are
children of node B. B is
the parent of these
nodes.
Degree of a node: It refers to the number of subtrees of a

node in a tree.
Edge: A link from the parent to a child node is referred to as
an edge.
A Degree of node C is 1
Degree of node D is 2
B C D Degree of node A is 3
Edge Degree of node B is 4
E F G H I J K
L M
Siblings/Brothers: It refers to the children of the same node.
A Nodes B, C, and D are

siblings of each other.
B C D Nodes E, F, G, and H are
siblings of each other.
E F G H I J K
L M
Internal node: It refers to any node between the root and a
leaf node.
Level of a node: It refers to the distance (in number of
nodes) of a node from the root. Root always lies at level 0.
As you move down the tree, the level increases by one.
Level 0
A
Nodes B, C, D, and K are
internal nodes. Level 1
B C D
E F G H I J K Level 2
L M Level 3
Depth of a tree: Refers to the total number of levels in the

tree.
The depth of the following tree is 4.
Level 0
A
Level 1
B C D
L M Level 3
Depth of a tree: Refers to the total number of levels in the

tree.
The depth of the following tree is 4.
Level 0
A
Level 1
B C D
L M Level 3
Just a minute
Consider the following tree and answer the questions that

follow:
a. What is the depth of the tree?
b. Which nodes are children of node B?
c. Which node is the parent of node F?
root
d. What is the level of node E?
e. Which nodes are the siblings of node H?
A
f. Which nodes are the siblings of node D?
g. Which nodes are leaf nodes?
B C
D E F G
H I
Just a minute
Answer:
a. 4
b. D and E
c. C
d. 2
e. H does not have any siblings
f. The only sibling of D is E
g. F, G, H, and I
Defining Binary Trees
Binary
Strictlytree is atree:
binary specific type of tree in which each node can
haveAat mosttree
binary twoinchildren namely
which every node,left child
except forand right
the leaf child.has
nodes,
non-empty
There left and
are various right
types children.
of binary trees:
Strictly binary tree
Full binary tree
Complete binary tree
Defining Binary Trees (Contd.)
Full binary tree:

d
A binary tree of depth d that contains exactly 2 – 1 nodes.
A
Depth = 3
Total number of
3
nodes = 2 – 1 = 7
B C
D E F G
Defining Binary Trees (Contd.)
Complete binary tree:

A binary tree with n nodes and depth d whose nodes correspond
to the nodes numbered from 0 to n − 1 in the full binary tree of
depth k.
0 0 0
A A A
1 B 2 C 1 B 2 C 1 B 2 C
3 4 5 6 3 4 5 3 4 6
D E F G D E F D E G
Full Binary Tree Complete Binary Tree Incomplete Binary Tree

Representing a Binary Tree
Array representation of binary trees: If there are n nodes in a binary tree,

All the nodes are represented as the elements of an
thenarray.
for any node with index i,
where 0 < i < n – 1:
Parent of i is at (i – 1)/2.
A [0] Left child of i is at 2i + 1:
If 2i + 1 > n – 1, then the
B [1] node does not have a
0 left child.
C [2]
Right child of i is at 2i + 2:
A
If 2i + 2 > n – 1, then the
D [3]
node does have a right
1 2 child.
E [4]
B C
3 4 5 6 F [5]
D E F G
G [6]
Binary Tree Array Representation

Example: Construct an Binary Search Tree (BST) for the data
555 501 701 358 513 561 797 345 490 724
555 555
555 555 555 555
555
501 701 501 701
501 501 701 501 701 501 701
358 513 561 358 513 561 797

358 358 513
555 555
501 701 501 701
358 513 561 797 358 513 561 797

Array Implementation:
345 490 345 490 724
555 501 701 358 513 561 797 345 490 724
21
Representing a Binary Tree (Contd.)
Linked representation of a binary tree:

It uses a linked list to implement a binary tree.
Each node in the linked representation holds the following
information:
Data
Reference to the left child
Reference to the right child
If a node does not have a left child or a right child or both, the
respective left or right child fields of that node point to NULL.
Data
Node
Representing a Binary Tree (Contd.)
root root
. 52 .
52
36 68 . 36 . 68 .
24 59 72 24 59 . 72 .
70 80 . 70 80
Binary Tree Linked Representation

Traversing a Binary Tree
You can implement various operations on a binary tree.

A common operation on a binary tree is traversal.
Traversal refers to the process of visiting all the nodes of a
binary tree once.
There are three ways for traversing a binary tree:
Inorder traversal
Preorder traversal
Postorder traversal
Inorder Traversal
Steps for traversing a tree in inorder sequence are as follows:

1. Traverse the left subtree
2. Visit root
3. Traverse the right subtree
Let us consider an example.
Inorder Traversal (Contd.)
B is not NULL.
The left subtree of node A
Therefore, move to node BD to
to traverse
traverse the
the left
left
B.
subtree of A.
root
B C
D E F G
I
H
The left subtree of node D is NULL.

Therefore, visit node D.
root
B C
D E F G
I
H
D
Right subtree of D is not NULL

Therefore, move to the right subtree of node D
root
B C
D E F G
I
H
D
Left subtree of H is empty.

Therefore, visit node H.
root
B C
D E F G
I
H
D H
Right subtree of H is empty.

Therefore, move to node B.
root
B C
D E F G
I
H
D H
The left subtree of B has been visited.

Therefore, visit node B.
root
B C
D E F G
I
H
D H B
Right subtree of B is not empty.

Therefore, move to the right subtree of B.
root
B C
D E F G
I
H
D H B
Left subtree of E is empty.

Therefore, visit node E.
root
B C
D E F G
I
H
D H B E
Right subtree of E is empty.

Therefore, move to node A.
root
B C
D E F G
I
H
D H B E
Left subtree of A has been visited.

Therefore, visit node A.
root
B C
D E F G
I
H
D H B E A
Right subtree of A is not empty.

Therefore, move to the right subtree of A.
root
B C
D E F G
I
H
D H B E A
Left subtree of C is not empty.

Therefore, move to the left subtree of C.
root
B C
D E F G
I
H
D H B E A
Left subtree of F is empty.

Therefore, visit node F.
root
B C
D E F G
I
H
D H B E A F
Right subtree of F is empty.

Therefore, move to node C.
root
B C
D E F G
I
H
D H B E A F
The left subtree of node C has been visited.

Therefore, visit node C.
root
B C
D E F G
I
H
D H B E A F C
Right subtree of C is not empty.

Therefore, move to the right subtree of node C.
root
B C
D E F G
I
H
D H B E A F C
Left subtree of G is not empty.

Therefore, move to the left subtree of node G.
root
B C
D E F G
I
H
D H B E A F C
Left subtree of I is empty.

Therefore, visit I.
root
B C
D E F G
I
H
D H B E A F C I
Right subtree of I is empty.

Therefore, move to node G.
root
B C
D E F G
I
H
D H B E A F C I
Visit node G.
root
B C
D E F G
I
H
D H B E A F C I G
Right subtree of G is empty.
root
B C
Traversal complete
D E F G
I
H
D H B E A F C I G
Preorder Traversal
Steps for traversing a tree in preorder sequence are as follows:

1. Visit root
Preorder Traversal (Contd.)
Perform the preorder traversal of the following tree.
B C
D E F G
I
H
Preorder Traversal: A B D H E C F G I
Postorder Traversal
Steps for traversing a tree in postorder sequence are as follows:

3. Visit the root
Postorder Traversal (Contd.)
Perform the postorder traversal of the following tree.
B C
D E F G
I
H
Postorder Traversal: H D E B F I G C A
Just a minute
In _________ traversal method, root is processed before

traversing the left and right subtrees.
Answer:
Preorder
Implementing a Binary Search Tree
Consider a scenario. SysCall Ltd. is a cellular phone company

with millions of customers spread across the world. Each
customer is assigned a unique identification number (id).
Individual customer records can be accessed by referring to
the respective id. These ids need to be stored in a sorted
manner in such a way so that you can perform various
transactions, such as retrieval, insertion, and deletion, easily.
Implementing a Binary Search Tree (Contd.)
Which datayou
Therefore, structure
need towill you use to
implement storestructure
a data the id of that
the
customers?
provides the advantages of both arrays as well as linked lists.
Can you
A binary implement
search an array? the advantages of both arrays
tree combines
and linked lists.
Search operation in an array is fast.
However, insertion and deletion in an array is complex in nature.
In this case, the total number of customer ids to be stored is very
large. Therefore, insertion and deletion will be very time
consuming.
Can you implement a linked list?
Insert and delete operation in a linked is fast.
However, linked lists allow only sequential search.
If you need to access a particular customer id, which is located near
the end of the list, then it would require you to visit all the
preceding nodes, which again can be very time consuming.
Defining a Binary Search Tree
The following
Binary is anisexample
search tree a binaryoftree
a binary search
in which tree.
every node satisfies
the following conditions:
All values in the left subtree of a node are less than the value of
the node. 52
All values in the right subtree of a node are greater than the value
of the node.
36 68
24 44 59 72
40 55
Defining a Binary Search Tree (Contd.)
You can implement various operations on a binary search tree:

Traversal
Search
Insert
Delete
Searching a Node in a Binary Search Tree
Search
To operation
search refersvalue,
for a specific to theyou
process
needoftosearching for a
perform the
specified value
following steps:in the tree.
1. Make currentNode point to the root node
2. If currentNode is null:
a. Display “Not Found”
b. Exit
3. Compare the value to be searched with the value of currentNode.
Depending on the result of the comparison, there can be three
possibilities:
a. If the value is equal to the value of currentNode:
i. Display “Found”
ii. Exit
b. If the value is less than the value of currentNode:
i. Make currentNode point to its left child
ii. Go to step 2
c. If the value is greater than the value of currentNode:
i. Make currentNode point to its right child
ii. Go to step 2
Just a minute
In a binary search tree, all the values in the left subtree of a

node are _______ than the value of the node.
Answer:
smaller
Inserting Nodes in a Binary Search Tree
Beforean
Write inserting
algorithma node in a binary
to locate searchof
the position tree, younode
a new first to
need
be
to check in
inserted whether thesearch
a binary tree istree.
empty or not.
If the tree is empty, make the new node as root.
If the tree is not empty, you need to locate the appropriate
position for the new node to be inserted.
This requires you to locate the parent of the new node to be
inserted.
Once the parent is located, the new node is inserted as the left
child or right child of the parent.
To locate the parent of the new node to be inserted, you need
to implement a search operation in the tree.
Inserting Nodes in a Binary Search Tree (Contd.)
1. Mark the root node as currentNode

Algorithm to locate the 2. Make parent point to NULL
parent of the new node to
3. Repeat steps 4, 5, and 6 until currentNode
be inserted. becomes NULL
4. Make parent point to currentNode

root
5. If the value of the new node is less than that of
. 52 . currentNode:
a. Make currentNode point to its left child
6. If the value of the new node is greater than that

. 36 . 68 . of currentNode:
a. Make currentNode point to its right child
24 59 . 72 .
. 70 80

Refer to the algorithm to
Locate the position of a new node 55. 2. Make parent point to NULL
locate the parent of the
new node to be inserted. becomes NULL

root
. 52 . currentNode:

24 59 . 72 .
. 70 80

becomes NULL

root
currentNode . 52 . currentNode:

24 59 . 72 .
. 70 80

becomes NULL

root
parent = NULL 5. If the value of the new node is less than that of

24 59 . 72 .
. 70 80

becomes NULL

root
parent = NULL 5. If the value of the new node is less than that of

24 59 . 72 .
. 70 80

becomes NULL

root
parent
parent= NULL 5. If the value of the new node is less than that of

24 59 . 72 .
. 70 80

becomes NULL
55 > 52
root
parent 5. If the value of the new node is less than that of

24 59 . 72 .
. 70 80

becomes NULL
55 > 52
root

24 59 . 72 .
. 70 80

becomes NULL
55 > 52
root

currentNode
24 59 . 72 .
. 70 80

becomes NULL

root
. 52 . currentNode:

currentNode
24 59 . 72 .
. 70 80

becomes NULL

root
. 52 . currentNode:

parent currentNode
24 59 . 72 .
. 70 80

becomes NULL
55 < 68
root
. 52 . currentNode:

parent currentNode
24 59 . 72 .
. 70 80

becomes NULL
55 < 68
root
. 52 . currentNode:

parent currentNode
24 59 . 72 .
currentNode
. 70 80

becomes NULL

root
. 52 . currentNode:

parent
24 59 . 72 .
currentNode
. 70 80

becomes NULL

root
. 52 . currentNode:

parent
parent a. Make currentNode point to its right child
24 59 . 72 .
currentNode
. 70 80

becomes NULL
55 < 59
root
. 52 . currentNode:

24 59 . 72 .
currentNode
. 70 80

becomes NULL
55 < 59
root
. 52 . currentNode:

24 59 . 72 .
currentNode
currentNode = NULL
. 70 80

becomes NULL

root
. 52 . currentNode:

24 59 . 72 .
currentNode = NULL
. 70 80

Once the parent of the new 2. Make parent point to NULL
node is located, you can insert
the node as the child of its becomes NULL
parent. 4. Make parent point to currentNode
root
. 52 . currentNode:

24 59 . 72 .
currentNode = NULL
. 70 80
Write an algorithm to insert a node in a binary search tree.

1. Allocate memory for the new node.
2. Assign value to the data field of new node.

Insert 55 to insert a node
Algorithm
3. Make the left and right child of the new node
in a binary search tree. point to NULL.
4. Locate the node which will be the parent of the

node to be inserted. Mark it as parent.
root
5. If parent is NULL (Tree is empty):
. 52 . a. Mark the new node as ROOT

b. Exit
6. If the value in the data field of new node is less

. 36 . 68 . than that of parent:
a. Make the left child of parent point to

the new node
24 59 . 72 . b. Exit
7. If the value in the data field of the new node is

greater than that of the parent:
. 70 80 a. Make the right child of parent point to

the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit

. 70 80 a. Make the right child of parent point to

the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit

55 . 70 80 a. Make the right child of parent point to

the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit


the new node
b. Exit

point to NULL.

root

b. Exit

parent a. Make the left child of parent point to

the new node
24 59 . 72 . b. Exit


the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit


the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit


the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 . 59 . 72 . b. Exit


the new node
b. Exit

point to NULL.

root

b. Exit


the new node
24 59 . 72 . b. Exit


the new node
b. Exit
Insert operation complete
Deleting Nodes from a Binary Search Tree
Deletean
Write operation in to
algorithm a binary
locate search tree refers
the position of thetonode
the process
to of
deletingfrom
deleted the specified node from
a binary search tree.the tree.
Before implementing a delete operation, you first need to
locate the position of the node to be deleted and its parent.
To locate the position of the node to be deleted and its parent,
you need to implement a search operation.
Deleting Nodes from a Binary Search Tree (Contd.)
1. Make a variable/pointer currentNode point to

the ROOT node.
Suppose
Algorithmyou
towant
locatetothe
delete
node to
2. Make a variable/pointer parent point to NULL.
node
be deleted.
70
3. Repeat steps a, b, and c until currentNode
becomes NULL or the value of the node to be
root searched becomes equal to that of
currentNode:
. 52 . a. Make parent point to currentNode.
b. If the value to be deleted is less than

that of currentNode:
. 36 . 68 .
i. Make currentNode point to its
left child.
24 59 . 72 . c. If the value to be deleted is greater than


. 70 80 right child.
69

the ROOT node.
Suppose you want to delete
node 70
currentNode:
currentNode . 52 . a. Make parent point to currentNode.

. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:
parent = NULL
. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:
parent = NULL
. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:
currentNode . 52 . parent
a. Make parent point to currentNode.
parent = NULL
. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:

. 36 . 68 . 70 > 52
left child.


69

the ROOT node.
node 70
currentNode:

. 36 . 68 . 70 > 52
left child.


69

the ROOT node.
node 70
currentNode:
currentNode
. 36 . 68 . 70 > 52
left child.


69

the ROOT node.
node 70
currentNode:
. 52 . parent
currentNode
. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:
. 52 . parent
currentNode
. 36 parent . 68 .
left child.


69

the ROOT node.
node 70
70 > 68 currentNode:
currentNode
. 36 parent . 68 .
left child.


69

the ROOT node.
node 70
currentNode
. 36 parent . 68 .
left child.


69

the ROOT node.
node 70
currentNode
. 36 parent . 68 .
currentNode i. Make currentNode point to its
left child.


69

the ROOT node.
node 70
currentNode:

. 36 parent . 68 .
left child.


69

the ROOT node.
node 70
currentNode:

. 36 parent . 68 .
left child.

parent i. Make currentNode point to its

69

the ROOT node.
node 70
currentNode:
. 52 .
70 < 72 a. Make parent point to currentNode.

. 36 . 68 .
left child.


69

the ROOT node.
node 70
currentNode:
. 52 .
70 < 72 a. Make parent point to currentNode.

. 36 . 68 .
left child.


currentNode
69

the ROOT node.
node 70
currentNode:

. 36 . 68 .
left child.


Nodes located . 70 80 right child.
currentNode
69
Once the nodes are located, there can be three cases:

Case I: Node to be deleted is the leaf node
Case II: Node to be deleted has one child (left or right)
Case III: Node to be deleted has two children
Write an algorithm to delete a leaf node from a binary search

tree.
1. Locate the node to be deleted. Mark it as

Delete node
Algorithm to69
delete a leaf currentNode and its parent as parent.
node from the binary tree. 2. If currentNode is the root node: // If parent is
// NULL
a. Make ROOT point to NULL.

. 52 . b. Go to step 5.
3. If currentNode is left child of parent:
. 36 . 68 . a. Make left child field of parent point to

NULL.
b. Go to step 5.
24 59 . 72 . 4. If currentNode is right child of parent:
a. Make right child field of parent point to

NULL.
b. Go to step 5.
. 70 80
5. Release the memory for currentNode.
69

Delete node 69 currentNode and its parent as parent.
2. If currentNode is the root node: // If parent is

// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
currentNode


// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
currentNode


// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
currentNode


// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
currentNode


// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
currentNode


// NULL

. 52 . b. Go to step 5.

NULL.
b. Go to step 5.

NULL.
b. Go to step 5.
. 70 80
parent
69
Delete operation complete
currentNode
Write an algorithm to delete a node, which has one child from

a binary search tree.

currentNode and its parent as parent.
Algorithm
Delete to80
node delete a node
2. If currentNode has a left child:
with one child. a. Mark the left child of currentNode as
root child.
b. Go to step 4.
. 52 .
3. If currentNode has a right child:
a. Mark the right child of currentNode as
child.
. 36 . 68 . b. Go to step 4.
4. If currentNode is the root node:

a. Mark child as root.
b. Go to step 7.
24 59 . 72 .
5. If currentNode is the left child of parent:
a. Make left child field of parent point to
child.
70 . 80 b. Go to step 7.
6. If currentNode is the right child of parent:

75 child.
b. Go to step 7.
7. Release the memory of currentNode.


Delete node 80
a. Mark the left child of currentNode as
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.
parent 4. If currentNode is the root node:

b. Go to step 7.
24 59 . 72 .
currentNode5. If currentNode is the left child of parent:
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.
child 7. Release the memory of currentNode.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.


Delete node 80
root child.
b. Go to step 4.
. 52 .
child.
. 36 . 68 . b. Go to step 4.

b. Go to step 7.
24 59 . 72 .
child.
70 . 80 b. Go to step 7.

75 child.
b. Go to step 7.
Write an algorithm to delete a node, which has two children

from a binary search tree.

Delete node
Algorithm to72
delete a node
2. Locate the inorder successor of currentNode.
with two children. Mark it as Inorder_suc. Execute the following
root
steps to locate Inorder_suc:
. 52 . Inorder_suc.
b. Repeat until the left child of
Inorder_suc becomes NULL:
i. Make Inorder_suc point to its left
. 36 . 68 . child.
3. Replace the information held by currentNode

with that of Inorder_suc.
24 59 . 72 . 4. If the node marked Inorder_suc is a leaf node:

a. Delete the node marked Inorder_suc by
using the algorithm for Case I.
70 . 80 5. If the node marked Inorder_suc has one child:

using the algorithm for Case II.
75

Delete node 72
Mark it as Inorder_suc. Execute the following
root
. 52 . Inorder_suc.
parent Inorder_suc becomes NULL:
. 36 . 68 . child.
currentNode 3. Replace the information held by currentNode



75

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.



75

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.



Inorder_suc
75

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.



Inorder_suc
75

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.



Inorder_suc
75
Inorder_suc

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.

24 59 . 72
75 . 4. If the node marked Inorder_suc is a leaf node:

75
Inorder_suc

Delete node 72
root
. 52 . Inorder_suc.
. 36 . 68 . child.



75
Inorder_suc

Delete node 72:
root
. 52 . Inorder_suc.
. 36 . 68 . child.



75
Inorder_suc
Activity: Implementing a Binary Search Tree
Problem Statement:
Write a program to implement insert and traverse operations on
a binary search tree that contains the words in a dictionary.
Summary
In this session, you learned that:

A tree is a nonlinear data structure that represents a hierarchical
relationship among the various data elements.
A binary tree is a specific type of tree in which each node can
have a maximum of two children.
Binary trees can be implemented by using arrays as well as linked
lists, depending upon requirement.
Traversal of a tree is the process of visiting all the nodes of the
tree once. There are three types of traversals, namely inorder,
preorder, and postorder traversal.
Binary search tree is a binary tree in which the value of the left
child of a node is always less than the value of the node, and the
value of the right child of a node is greater than the value of the
node.
Summary (Contd.)
Inserting a node in a binary search tree requires you to first

locate the appropriate position for the node to be inserted.
You need to check for the following three cases before deleting a
node from a binary search tree.
If the node to be deleted is the leaf node
If the node to be deleted has one child (left or right)
If the node to be deleted has two children
root
B C
D E F G
H K I M

Binary Tree

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Binary Tree

Uploaded by

Copyright:

Available Formats

Storing Data in a Tree

Consider a scenario where you are required to represent the directory

Each element in a tree is referred to as a node.

Each node in a tree can further have subtrees below its

Leaf node: It refers to a node with no children.

Children of a node: The roots of the subtrees of a node are

Degree of a node: It refers to the number of subtrees of a

Siblings/Brothers: It refers to the children of the same node.

A Nodes B, C, and D are

Depth of a tree: Refers to the total number of levels in the

Depth of a tree: Refers to the total number of levels in the

Consider the following tree and answer the questions that

Full binary tree:

Complete binary tree:

Full Binary Tree Complete Binary Tree Incomplete Binary Tree

Array representation of binary trees: If there are n nodes in a binary tree,

Binary Tree Array Representation

358 513 561 358 513 561 797

501 701 501 701

358 513 561 797 358 513 561 797

Linked representation of a binary tree:

Binary Tree Linked Representation

You can implement various operations on a binary tree.

Steps for traversing a tree in inorder sequence are as follows:

The left subtree of node D is NULL.

Right subtree of D is not NULL

Left subtree of H is empty.

Right subtree of H is empty.

The left subtree of B has been visited.

Right subtree of B is not empty.

Left subtree of E is empty.

Right subtree of E is empty.

Left subtree of A has been visited.

Right subtree of A is not empty.

Left subtree of C is not empty.

Left subtree of F is empty.

Right subtree of F is empty.

The left subtree of node C has been visited.

Right subtree of C is not empty.

Left subtree of G is not empty.

Left subtree of I is empty.

Right subtree of I is empty.

Right subtree of G is empty.

Steps for traversing a tree in preorder sequence are as follows:

Perform the preorder traversal of the following tree.

Steps for traversing a tree in postorder sequence are as follows:

Perform the postorder traversal of the following tree.

In _________ traversal method, root is processed before

Consider a scenario. SysCall Ltd. is a cellular phone company

You can implement various operations on a binary search tree:

In a binary search tree, all the values in the left subtree of a

1. Mark the root node as currentNode

4. Make parent point to currentNode

a. Make currentNode point to its left child

6. If the value of the new node is greater than that

a. Make currentNode point to its right child

1. Mark the root node as currentNode

4. Make parent point to currentNode

a. Make currentNode point to its left child

6. If the value of the new node is greater than that

a. Make currentNode point to its right child

1. Mark the root node as currentNode

3. Repeat steps 4, 5, and 6 until currentNode

4. Make parent point to currentNode