Scribd
Upload
52 views

Binary Search Trees

Binary Search can perform operation find(k) on a dictionary implemented by means of an array-based sequence, sorted by key similar to the high-low game at each step, the number of candidate items is halved terminates after O(log n) steps. A Binary Search tree is a binary tree storing keys (or key-value entries) at its internal nodes and satisfying the following property.

Uploaded by

Nishant Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
52 views

Binary Search Trees

Binary Search can perform operation find(k) on a dictionary implemented by means of an array-based sequence, sorted by key similar to the high-low game at each step, the number of candidate items is halved terminates after O(log n) steps. A Binary Search tree is a binary tree storing keys (or key-value entries) at its internal nodes and satisfying the following property.

Uploaded by

Nishant Shah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Binary Search Trees

<
2 1 6 9 4 = 8

>

2004 Goodrich, Tamassia

Binary Search Trees

Ordered Dictionaries
Keys are assumed to come from a total order. New operations:

first(): first entry in the dictionary ordering last(): last entry in the dictionary ordering successors(k): iterator of entries with keys greater than or equal to k; increasing order predecessors(k): iterator of entries with keys less than or equal to k; decreasing order
Binary Search Trees 2

2004 Goodrich, Tamassia

Binary Search ( 8.3.3)


Binary search can perform operation find(k) on a dictionary implemented by means of an array-based sequence, sorted by key

similar to the high-low game at each step, the number of candidate items is halved terminates after O(log n) steps

Example: find(7)
0 1 3 4 5 7 8 9 11 14 16 18 19

l
0 1
1 1

m
3 4
4

h
9
9 9

5
5

8
8 8

11
11 11

14
14 14

16
16 16

18
18 18

19
19 19

l
0 0

m
3 3

h
7

l
4

m
5

h
7

l=m =h
2004 Goodrich, Tamassia

Binary Search Trees

Search Tables
A search table is a dictionary implemented by means of a sorted sequence

We store the items of the dictionary in an array-based sequence, sorted by key We use an external comparator for the keys find takes O(log n) time, using binary search insert takes O(n) time since in the worst case we have to shift n/2 items to make room for the new item remove take O(n) time since in the worst case we have to shift n/2 items to compact the items after the removal

Performance:

The lookup table is effective only for dictionaries of small size or for dictionaries on which searches are the most common operations, while insertions and removals are rarely performed (e.g., credit card authorizations)
2004 Goodrich, Tamassia

Binary Search Trees

Binary Search Trees ( 9.1)


A binary search tree is a binary tree storing keys (or key-value entries) at its internal nodes and satisfying the following property:

An inorder traversal of a binary search trees visits the keys in increasing order
6 2 1 4 8 9

Let u, v, and w be three nodes such that u is in the left subtree of v and w is in the right subtree of v. We have key(u) key(v) key(w)

External nodes do not store items


2004 Goodrich, Tamassia

Binary Search Trees

Search ( 9.1.1)
Algorithm TreeSearch(k, v) To search for a key k, if T.isExternal (v) we trace a downward path starting at the root return v if k < key(v) The next node visited depends on the return TreeSearch(k, T.left(v)) outcome of the else if k = key(v) comparison of k with return v the key of the current else { k > key(v) } node return TreeSearch(k, T.right(v)) If we reach a leaf, the 6 key is not found and we < return nukk 2 9 Example: find(4): >

Call TreeSearch(4,root)

4 =

2004 Goodrich, Tamassia

Binary Search Trees

Insertion
To perform operation inser(k, o), we search for key k (using TreeSearch) Assume k is not already in the tree, and let let w be the leaf reached by the search We insert k at node w and expand w into an internal node Example: insert 5 <
2 1 6 9 4

> > w
6 8

2 1 4 8

w
5

2004 Goodrich, Tamassia

Binary Search Trees

Deletion
To perform operation remove(k), we search for key k Assume key k is in the tree, and let let v be the node storing k If node v has a leaf child w, we remove v and w from the tree with operation removeExternal(w), which removes w and its parent Example: remove 4 <
2 1 6 9 4 v 8 5

>
w

6 2 1 5 8 9

2004 Goodrich, Tamassia

Binary Search Trees

Deletion (cont.)
We consider the case where the key k to be removed is stored at a node v whose children are both internal

1 3 2

v
8 6 9

we find the internal node w that follows v in an inorder traversal we copy key(w) into node v we remove node w and its left child z (which must be a leaf) by means of operation removeExternal(z)

w z
1 5 2

v
8 6 9

Example: remove 3

2004 Goodrich, Tamassia

Binary Search Trees

Performance
Consider a dictionary with n items implemented by means of a binary search tree of height h

the space used is O(n) methods find, insert and remove take O(h) time

The height h is O(n) in the worst case and O(log n) in the best case
Binary Search Trees 10

2004 Goodrich, Tamassia

You might also like