Prof.

Amr Goneid, AUC 1

CSCE 210
Data Structures and Algorithms
Prof. Amr Goneid
AUC
Part 5. Dictionaries(2):
Binary Search Trees
Prof. Amr Goneid, AUC 2
Dictionaries(2): Binary Search
Trees
The Dictionary Data Structure
The Binary Search Tree (BST)
Search, Insertion and Traversal of BST
Removal of nodes from a BST
Binary Search Tree ADT
Template Class Specification
Other Search Trees (AVL Trees)
Prof. Amr Goneid, AUC 3
1.The Dictionary Data Structure
Simple containers such as tables, stacks and queues
permit access of elements by position or order of
insertion.
A Dictionary is a form of container that permits
access by content.
Should support the following main operations:
Insert (D,x): Insert item x in dictionary D
Delete (D,x): Delete item x from D
Search (D,k): search for key k in D
Prof. Amr Goneid, AUC 4
The Dictionary Data Structure
Examples:
Unsorted arrays and Linked Lists: permit linear
search
Sorted arrays: permit Binary search
Ordered Lists: permit linear search
Binary Search Trees (BST): fast support of all
dictionary operations.
Hash Tables: Fast retrieval by hashing key to a
position.
Prof. Amr Goneid, AUC 5
The Dictionary Data Structure
There are 3 types of dictionaries:
Static Dictionaries These are built once and
never change. Thus they need to support search, but
not insertion or deletion. These are better
implemented using arrays or Hash tables with linear
probing.
Semi-dynamic Dictionaries These structures
support insertion and search queries, but not
deletion. These can be implemented as arrays, linked
lists or Hash tables with linear probing.
Prof. Amr Goneid, AUC 6
The Dictionary Data Structure
Fully Dynamic Dictionaries These need
fast support of all dictionary operations.
Binary Search Trees are best. Hash tables
are also great for fully dynamic dictionaries as
well, provided we use chaining as the
collision resolution mechanism.
Prof. Amr Goneid, AUC 7
The Dictionary Data Structure
In the revision part R3, we present two
dictionary data structures that support all
basic operations. Both are linear structures
and so employ linear search, i.e O(n). They
are suitable for small to medium sized data.
The first uses a run-time array to implement
an ordered list and is suitable if we know the
maximum data size
The second uses a linked list and is suitable
if we do not know the size of data to insert.
Prof. Amr Goneid, AUC 8
The Dictionary Data Structure

In the following, we present the design and
implement a dictionary data structures that is
based on the Binary Search Tree (BST).
This will be a Fully Dynamic Dictionary
and basic operations are usually O(log n)
Prof. Amr Goneid, AUC 9
2. The Binary Search Tree (BST)
A Binary Search Tree (BST) is a Dictionary
implemented as a Binary Tree. It is a form of
container that permits access by content.
It supports the following main operations:
Insert : Insert item in BST
Remove : Delete item from BST
Search : search for key in BST

Prof. Amr Goneid, AUC 10
BST






A BST is a binary tree that stores keys or key-data pairs in
its nodes and has the following properties:
A key identifies uniquely the node (no duplicate keys)
If (u , v , w) are nodes such that (u) is any node in the left
subtree of (v) and (w) is any node in the right subtree of
(v) then:
key(u) < key(v) < key(w)

v
u
w
Prof. Amr Goneid, AUC 11
Examples Of BST
Prof. Amr Goneid, AUC 12
Examples Of BST
These are NOT BSTs.
Prof. Amr Goneid, AUC 13
3. Search, Insertion & Traversal of BST
Search (tree, target)
if (tree is empty)
target is not in the tree;
else if (the target key is the root)
target found in root;
else if (target key smaller than the roots key)
search left sub-tree;
else search right sub-tree;
Prof. Amr Goneid, AUC 14
Searching Algorithm
(Pseudo Code)
Searches for the item with same key as k
in the tree (t).
Bool search(t,k)
{
if (t is empty)return false;
else if (k == key(t))return true;
else if (k < key(t))
return search(t
left
, k);
else
return search(t
right
, k);
}
Prof. Amr Goneid, AUC 15
Searching for a key
Search for the node containing e:

Maximum number of comparisons is tree height, i.e. O(h)
Prof. Amr Goneid, AUC 16
Demo
http://www.cosc.canterbury.ac.nz/people/
mukundan/dsal/BST.html
Prof. Amr Goneid, AUC 17
Building a Binary Search Tree
Tree created from root downward
Item 1 stored in root
Next item is attached to left tree if value
is smaller or right tree if value is larger
To insert an item into an existing tree,
we must first locate the items parent
and then insert
Prof. Amr Goneid, AUC 18
Algorithm for Insertion
Insert (tree, new_item)
if (tree is empty)
insert new item as root;
else if (root key matches item)
skip insertion; (duplicate key)
else if (new key is smaller than root)
insert in left sub-tree;
else insert in right sub-tree;
Prof. Amr Goneid, AUC 19
Insertion (Pseudo Code)
Inserts key (k)in the tree (t)
Bool insert(t, k)
{ if (t is empty)
{
create node containing (k)and attach to (t);
return true;
}
else if (k == key(t)) return false;
else if (k < key(t)) return insert(t
left
, k);
else return insert(t
right
, k);
}


Prof. Amr Goneid, AUC 20
Example: Building a Tree
Insert: 40,20,10,50,65,45,30
Prof. Amr Goneid, AUC 21
Effect of Insertion Order
The shape of the tree depends on the order
of insertion. Shape determines the height (h)
of the tree.
Since cost of search is O(h), the insertion
order will affect the search cost.
The previous tree is full, and h = log
2
(n+1) so
that search cost is O(log
2
n)
Prof. Amr Goneid, AUC 22
Effect of Insertion Order






The previous tree would look like a linked list if we
have inserted in the order 10,20,30,. Its height
would be h = n and its search cost would be O(n)

O(n)
O(log n)
Prof. Amr Goneid, AUC 23
http://www.cosc.canterbury.ac.nz/people/
mukundan/dsal/BSTNew.html
Binary Search Tree Demo
Prof. Amr Goneid, AUC 24
Linked Representation
The nodes in the BST will be implemented as a
linked structure:
left
element
right
16 45
32
40
32
16 45
40
t
Prof. Amr Goneid, AUC 25
Traversing a Binary Search Tree
Recursive inorder traversal of tree with root (t)
traverse ( t )
{
if (t is not empty)
traverse (t
left
);
visit (t);
traverse (t
right
);
}

Prof. Amr Goneid, AUC 26
Find Minimum Key
Find the minimum key in a tree with root (t)
Minkey ( t )
{
if (t
left
is not empty) return MinKey(t
left
);
else return key(t);
}

Prof. Amr Goneid, AUC 27
Other Traversal Orders
Pre-order (a.k.a. Depth-First traversal) can be implemented
using an iterative (non-recursive) algorithm. In this case, a
stack is used
If the stack is replaced by a queue and left pointers are
exchanged by right pointers, the algorithm becomes Level-
order traversal (a.k.a. Breadth-First traversal)

Prof. Amr Goneid, AUC 28
Iterative Preorder Traversal
void iterative_preorder ( )
{
t = root;
Let s be a stack
s.push (t);
while(!s.stackIsEmpty())
{ s.pop(t); process(t->key);
if ( t
right
is not empty) s.push(t
right
);
if ( t
left
is not empty) s.push(t
left
);
}
}
Prof. Amr Goneid, AUC 29
Pre-Order Traversal
Traversal order: {D,B,A,C,F,E,G}
D
B F
A C E G
1
2
3
4
5
6 7
Prof. Amr Goneid, AUC 30
Level Order Traversal
void levelorder ( )
{
t = root;
Let q be a queue;
q.enqueue(t);
while(!q.queueIsEmpty())
{ q.dequeue(t); process(t->key);
if ( t
left
is not empty) q.enqueue(t
left
);
if ( t
right
is not empty) q.enqueue(t
right
);
}
}
Prof. Amr Goneid, AUC 31
Level-Order Traversal
Traversal order: {D,B,F,A,C,E,G}
A C E G
B F
D
1
2 3
4
5
6 7
Prof. Amr Goneid, AUC 32
4. Removal of Nodes from a BST
Prof. Amr Goneid, AUC 33
Deleting a ROOT Node
Prof. Amr Goneid, AUC 34
Deleting a ROOT Node
Prof. Amr Goneid, AUC 35
Deleting a ROOT Node (Special
Case)
Prof. Amr Goneid, AUC 36
Deleting a ROOT Node (Alternative)
Prof. Amr Goneid, AUC 37
Deleting an Internal Node
Prof. Amr Goneid, AUC 38
Search for Parent of a Node
To delete a node, we need to find its parent.
To search for the parent (p) of a node (x) with key (k)
in tree (t):
Set x = t; p = null; found = false;
While (not found) and (x is not empty)
{
if k < key(x) descend left (i.e. set p = x; x = x
left
)
else
if k > key(x) descend right (i.e. set p = x;x = x
right
)
else found = true
}
Notice that:
P is null if (k) is in the root or if the tree is empty.
If (k) is not found, p points to what should have been
its parent.
Prof. Amr Goneid, AUC 39
Algorithm to remove a Node
Let
k = key to remove its node
t = pointer to root of tree
x = location where k is found
p = parent of a node
sx = inorder successor of x
s = child of x
Prof. Amr Goneid, AUC 40
Algorithm to remove a Node
Remove (t,k)
{
Search for (k) and its parent;
If not found, return;
else it is found at (x) with parent at (p):
Case (x) has two children:
Find inorder successor (sx) and its parent (p);
Copy contents of (sx) into (x);
Change (x) to point to (sx);

Now (x) has one or no children and (p) is its parent
Prof. Amr Goneid, AUC 41
Algorithm to remove a Node
Case (x) has one or no children:
Let (s) point to the child of (x) or null if there
are no children;
If p = null then set root to null;
else if (x) is a left child of (p), set p
left
= s;
else set p
right
= s;

Now (x) is isolated and can be deleted
delete (x);
}
Prof. Amr Goneid, AUC 42
Example: Delete Root






40
20
10
30
60
50 70
x
p = null
Prof. Amr Goneid, AUC 43
Example: Delete Root






40
20
10
30
60
50 70
x
p
sx
Prof. Amr Goneid, AUC 44
Example: Delete Root






50
20
10
30
60
50 70
p
x
S = null
Prof. Amr Goneid, AUC 45
Example: Delete Root






50
20
10
30
60
50
70
x
null
delete
Prof. Amr Goneid, AUC 46
5. Binary Search Tree ADT
Elements:
A BST consists of a collection of elements that are all
of the same type. An element is composed of two
parts: key of <keyType> and data of <dataType>
Structure:
A node in a BST has at most two subtrees. The key
value in a node is larger than all the keys in its left
subtree and smaller than all keys in its right subtree.
Duplicate keys are not allowed.

Prof. Amr Goneid, AUC 47
Binary Search Tree ADT
Data members
root pointer to the tree root

Basic Operations
binaryTree a constructor
insert inserts an item
empty checks if tree is empty
search locates a node given a
key
Prof. Amr Goneid, AUC 48
Binary Search Tree ADT
Basic Operations (continued)
retrieve retrieves data given key
traverse traverses a tree
(In-Order)
preorder pre-order traversal
levelorder Level-order traversal
remove Delete node given key
graph simple graphical output
Prof. Amr Goneid, AUC 49
Node Specification
// The linked structure for a node can be
// specified as a Class in the private part of
// the main binary tree class.
class treeNode // Hidden from user
{
public:
keyType key; // key
dataType data; // Data
treeNode *left; // left subtree
treeNode *right; // right subtree
}; // end of class treeNode declaration

//A pointer to a node can be specified by a type:
typedef treeNode * NodePointer;
NodePointer root;
Prof. Amr Goneid, AUC 50
6. Template Class Specification
Because node structure is private, all references to pointers
are hidden from user
This means that recursive functions with pointer
parameters must be private.
A public (User available) member function will have to call
an auxiliary private function to support recursion.
For example, to traverse a tree, the user public function will
be declared as:
void traverse ( ) const;
and will be used in the form:
BST.traverse ( );

Prof. Amr Goneid, AUC 51
Template Class Specification
Such function will have to call a private traverse function:
void traverse2 (NodePointer ) const;
Therefore, the implementation of traverse will be:

template <class keyType, class dataType>
void binaryTree<keyType, dataType>::traverse() const
{
traverse2(root);
}
Notice that traverse2 can support recursion via its pointer
parameter
Prof. Amr Goneid, AUC 52
Template Class Specification
For example, if we use in-order traversal, then the private
traverse function will be implemented as:

template <class keyType, class dataType>
void binaryTree <keyType, dataType>::traverse2
(NodePointer aRoot) const
{
if (aRoot != NULL)
{ // recursive in-order traversal
traverse2 (aRoot->left);
cout << aRoot->key << endl;
traverse2 (aRoot->right);
}
} // end of private traverse
Prof. Amr Goneid, AUC 53
Template Class Specification
All similar functions will be implemented using
the same method. For example:
Public Function Private Function
insert (key,data) insert2 (pointer,key,data)
search(key) search2 (pointer,key)
retrieve(key,data) retrieve2 (pointer,key,data)
traverse( ) traverse2 (pointer)
Prof. Amr Goneid, AUC 54
BinaryTree.h
// FILE: BinaryTree.h
// DEFINITION OF TEMPLATE CLASS BINARY SEARCH
// TREE

#ifndef BIN_TREE_H
#define BIN_TREE_H

// Specification of the class
template <class keyType, class dataType>
class binaryTree
{
Prof. Amr Goneid, AUC 55
BinaryTree.h
public:
// Public Member functions ...
// CREATE AN EMPTY TREE
binaryTree();
// INSERT AN ELEMENT INTO THE TREE
bool insert(const keyType &,
const dataType &);
// CHECK IF THE TREE IS EMPTY
bool empty() const;
// SEARCH FOR AN ELEMENT IN THE TREE
bool search (const keyType &) const;
// RETRIEVE DATA FOR A GIVEN KEY
bool retrieve (const keyType &, dataType &)
const;

Prof. Amr Goneid, AUC 56
BinaryTree.h
// TRAVERSE A TREE
void traverse() const;
// Iterative Pre-order Traversal
void preorder () const;
// Iterative Level-order Traversal
void levelorder () const;
// GRAPHIC OUTPUT
void graph() const;
// REMOVE AN ELEMENT FROM THE TREE
void remove (const keyType &);
.........


Prof. Amr Goneid, AUC 57
BinaryTree.h
private:
// Node Class
class treeNode
{
public:
keyType key; // key
dataType data; // Data
treeNode *left; // left subtree
treeNode *right; // right subtree
}; // end of class treeNode declaration
typedef treeNode * NodePointer;
// Data member ....
NodePointer root;
Prof. Amr Goneid, AUC 58
BinaryTree.h
// Private Member functions ...
// Searches a subtree for a key
bool search2 ( NodePointer , const keyType &)
const;
//Searches a subtree for a key and retrieves data
bool retrieve2 (NodePointer , const keyType & ,
dataType &) const;
// Inserts an item in a subtree
bool insert2 (NodePointer &, const keyType &,
const dataType &);
Prof. Amr Goneid, AUC 59
BinaryTree.h
// Traverses a subtree
void traverse2 (NodePointer ) const;
// Graphic output of a subtree
void graph2 ( int , NodePointer ) const;
// LOCATE A NODE CONTAINING ELEMENT AND ITS
// PARENT
void parentSearch( const keyType &k,
bool &found,
NodePointer &locptr,
NodePointer &parent) const;
};
#endif // BIN_TREE_H
#include binaryTree.cpp
Prof. Amr Goneid, AUC 60
Implementation Files
Full implementation of the BST
class is found at:

http://www.cse.aucegypt.edu/~csci210/co
des.zip



Prof. Amr Goneid, AUC 61
7. Other Search Trees
Binary Search Trees have worst case
performance of O(n), and best case
performance of O(log n)
There are many other search trees that are
balanced trees.
Examples are: AVL Trees, Red-Black trees
Prof. Amr Goneid, AUC 62
AVL Trees
Named after its Russian inventors:
Adel'son-Vel'skii and Landis (1962)
An AVL tree is a binary search tree in
which
the heights of the right subtree and left subtree of
the root differ by at most 1
the left subtree and the right subtree are
themselves AVL trees
Prof. Amr Goneid, AUC 63
AVL Tree






Notice that:
N(h) = N(h-1) + N(h-2) + 1

h-1
h-2 h
Prof. Amr Goneid, AUC 64
AVL Tree

tree AVL the of height case worst the is This
44 1
2
5 1
5
1
1
: numbers Fibonacci for formula
e approximat the use can we and series Fibonacci a is This
1 2 1 1 1 {
Also
3
) N log( . h Or
) h ( N
} ) h ( N { } ) h ( N { } ) h ( N
h
~
|
|
.
|

\
|
+
~ +
+ + + = +
+