CH 12

1
Data Structures and Algorithms
BITS-Pilani K. K. Birla Goa Campus
1
Material for the presentation taken from Cormen, Leiserson, Rivest and
Stein, Introduction to Algorithms, Third Edition; 1
BITS-Pilani K. K. Birla Goa Campus Data Structures and Algorithms
Ch. 12: Binary Search Trees
I Dynamic set : Linked list, Hash Table
2

I Binary Search Tree is a data structure that supports many
dynamic set operations:
2

Search, Minimum, Maximum, Predecessor,
Successor, Insert and Delete.
2

Successor, Insert and Delete.
I The basic operations take time proportional to the height of
the tree (i.e. O(h) time).
2
Binary search tree
I Binary-search-tree property
3
Binary search tree
Let x be a node in a binary search tree. If y is a node in the
left subtree of x, then y .key ≤ x.key . If y is a node in the
right subtree of x, then y .key ≥ x.key .
3
Binary search tree
Let x be a node in a binary search tree. If y is a node in the
left subtree of x, then y .key ≤ x.key . If y is a node in the
right subtree of x, then y .key ≥ x.key .
I Each node contains a key, satellite data; and attributes left,
right and p.
3
Binary search tree
I Does the above binary tree satisfy the Binary-search-tree

property?
4
Binary search tree
I Does the above binary tree satisfy the Binary-search-tree

property?
I The worst-case running time of the search tree operations will
be less efficient, because the height of the search tree is more.
4
Inorder tree walk
5
Inorder tree walk
function Inorder-Tree-Walk(x)
if x 6= NIL then
Inorder-Tree-Walk(x.left)
print x.key
Inorder-Tree-Walk(x.right)
5
Inorder tree walk
if x 6= NIL then
print x.key
I Inorder-Tree-Walk(T .root)
5
Inorder tree walk
if x 6= NIL then
print x.key
I Inorder-Tree-Walk(T .root)
I Inorder tree walk prints the keys in a sorted order for a binary
search tree.
5
Inorder tree walk
if x 6= NIL then
print x.key
I What is the running time of
Inorder-Tree-Walk(T .root)?
6
Querying a binary search tree
I Operations: Search, Minimum, Maximum,

Predecessor, Successor, Insert and Delete
7
Querying a binary search tree
I Operations: Search, Minimum, Maximum,

Predecessor, Successor, Insert and Delete
I All the operations can be performed in O(h) time.
7
Tree-search(x, k)
8
Tree-search(x, k)
I How can we search node 13?
8
Tree-search(x, k)

8
Tree-search(x, k)
9
Tree-search(x, k)
Running time of Tree-search procedure?

9
Tree-minimum
I How can we find the minimum element?
10
Tree-minimum
I How can we find the minimum element?
10
Tree-maximum
I How about the maximum element?
11
Tree-maximum
11
Tree-maximum
I Tree-minimum and Tree-maximum run in O(h) time.

11
Using Dijkstra’s algorithm
I Let G (V , E ) be a graph having negative edge weights. Can

we use Dijkstra’s algorithm?
12
Successor and Predecessor
I Successor of a node x in the BST is the node that comes

after node x during an inorder tree walk.
13
Tree-successor
14
Tree-successor
I How will we find the successor of 15?
14
Tree-successor

Tree-minimum(15.right)
14
Tree-successor

I What if there is no right child?
14
Tree-successor

I What if there is no right child?
E.g. How will we find the successor of 13?
14
Tree-successor
15
Tree-successor
I Tree-successor runs in O(h) time.
16
Tree-successor
I Tree-successor runs in O(h) time.

I The procedure Tree-predecessor is symmetric to
Tree-successor.
16
Insert and Delete
17
Insert and Delete
I After we Insert or Delete a node from the BST, the

binary-search-tree property must continue to hold.
17
Insert and Delete
I After we Insert or Delete a node from the BST, the

binary-search-tree property must continue to hold.
17
Tree-Insert
18
Tree-Delete
I For deleting a node, we need to consider multiple cases.
19
Tree-Delete

I We want to delete node z, where z has at most one child
node.
19
Tree-Delete

node.
19
Tree-Delete

node.
19
Tree-delete procedure
20
Transplant procedure
I Transplant procedure moves subtrees within a binary

search tree.
21

search tree.
21

search tree.
I Transplant procedure simplifies the Tree-Delete

procedure.
21
22
Tree-Delete : Node z has two child nodes
I When node z has two child nodes, we replace z with its

successor node.
23
I When node z has two child nodes, we replace z with its

successor node.
(c) Successor node is the right child.
(d) Successor node is not the right child.
23
(c) Successor of node z is its right child.
24
24
I Suppose node y is the right child and the successor of node z.

Is it necessary that the left child of node y be NIL?
24
25
26
(d) Successor of node z is not its right child
27
27
27
28
29
I Tree-delete procedure takes O(h) time.
30
Building binary search trees
I What will the BST look like if we insert the keys in the
following order?
5, 1, 3, 6, 2, 4
31
following order?
5, 1, 3, 6, 2, 4
I What if the order was the following?
1, 2, 3, 4, 5, 6
31
following order?
5, 1, 3, 6, 2, 4
1, 2, 3, 4, 5, 6
I We can perform the following operations in O(h) time :
Successor, Insert and Delete
31
following order?
5, 1, 3, 6, 2, 4
1, 2, 3, 4, 5, 6
I We can perform the following operations in O(h) time :
Successor, Insert and Delete
I However, the height h depends on the order in which the keys
are inserted.
31
I Theorem: The expected height of a randomly built binary

search tree on n distinct keys is O(lg n).
32
I Theorem: The expected height of a randomly built binary

search tree on n distinct keys is O(lg n).
I Proof given in section 12.4. (Proof not part of the syllabus.)
32

CH 12

Uploaded by

Copyright:

Available Formats

CH 12

Uploaded by

Document Information

Original Title

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

CH 12

Uploaded by

Copyright:

Available Formats

1

Data Structures and Algorithms

BITS-Pilani K. K. Birla Goa Campus

I Dynamic set : Linked list, Hash Table

I Dynamic set : Linked list, Hash Table

I Dynamic set : Linked list, Hash Table

I Dynamic set : Linked list, Hash Table

I Does the above binary tree satisfy the Binary-search-tree

I Does the above binary tree satisfy the Binary-search-tree

I Operations: Search, Minimum, Maximum,

I Operations: Search, Minimum, Maximum,

I How can we search node 13?

I How can we search node 13?

Running time of Tree-search procedure?

I How can we find the minimum element?

I How can we find the minimum element?

I How about the maximum element?

I How about the maximum element?

I How about the maximum element?

I Tree-minimum and Tree-maximum run in O(h) time.

I Let G (V , E ) be a graph having negative edge weights. Can

I Successor of a node x in the BST is the node that comes

I How will we find the successor of 15?

I How will we find the successor of 15?

I How will we find the successor of 15?

I How will we find the successor of 15?

I Tree-successor runs in O(h) time.

I Tree-successor runs in O(h) time.

I After we Insert or Delete a node from the BST, the

I After we Insert or Delete a node from the BST, the

I For deleting a node, we need to consider multiple cases.

I For deleting a node, we need to consider multiple cases.

I For deleting a node, we need to consider multiple cases.

I For deleting a node, we need to consider multiple cases.

I Transplant procedure moves subtrees within a binary

I Transplant procedure moves subtrees within a binary

I Transplant procedure moves subtrees within a binary

I Transplant procedure simplifies the Tree-Delete

I When node z has two child nodes, we replace z with its

I When node z has two child nodes, we replace z with its

(c) Successor of node z is its right child.

(c) Successor of node z is its right child.

(c) Successor of node z is its right child.

I Suppose node y is the right child and the successor of node z.

(d) Successor of node z is not its right child

(d) Successor of node z is not its right child

(d) Successor of node z is not its right child

I Tree-delete procedure takes O(h) time.

I Theorem: The expected height of a randomly built binary

I Theorem: The expected height of a randomly built binary

You might also like