Embed Size (px)
Citation preview
Data Structures and Algorithms – COMS21103
Dynamic Search Structures
Self-balancing Trees and Skip Lists
Benjamin Sach
Dynamic Search Structures
A dynamic search structure,
Each element x must have a unique key - x.key
The following operations are supported:
DELETE(k) - deletes the (unique) element x with x.key = k
INSERT(x, k) - inserts x with key k = x.key
FIND(k) - returns the (unique) element x with x.key = k
(or reports that it doesn’t exist)
stores a set of elements
(or reports that it doesn’t exist)
Dynamic Search Structures
A dynamic search structure,
Each element x must have a unique key - x.key
The following operations are supported:
DELETE(k) - deletes the (unique) element x with x.key = k
INSERT(x, k) - inserts x with key k = x.key
FIND(k) - returns the (unique) element x with x.key = k
(or reports that it doesn’t exist)
stores a set of elements
(or reports that it doesn’t exist)
We would also like it to support (among others):
PREDECESSOR(k) - returns the (unique) element xwith the largest key such that x.key < k
RANGEFIND(k1, k2) - returns every element x with k1 6 x.key 6 k2
Using a Linked List as a Dynamic Search Structure
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
We could implement a Dynamic Search Structure using an unsorted linked list:
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Using a Linked List as a Dynamic Search Structure
5Bob
5Bob x
x.key
x
x.key
We could implement a Dynamic Search Structure using an unsorted linked list:
4Dawn
4Dawn
3Alice
35Emma
3Alice
36Emma
3Alice
33Alice
INSERT is very efficient,
- add the new item to the head of the list in O(1) time
8Chris
7Chris
FIND and DELETE are very inefficient, they take O(n) time
- we have to look through the entire linked list to find an item (in the worst case)
There are many ways in which we could implement a search structure. . .but they aren’t all efficient
4Dawn
4Dawn
Let n denote the number of elements stored in the structure- our goal is to implement a structure with operations which scale well as n grows
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
node
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
nodeleft subtree
(smaller keys)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
nodeleft subtree
(smaller keys)right subtree
(larger keys)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
node
left subtree(smaller keys)
right subtree(larger keys)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left21 > 20 so go right
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left21 > 20 so go right
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left21 > 20 so go right21 < 23 so go left
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left21 > 20 so go right21 < 23 so go left
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
FIND(21)
21 < 27 so go left21 > 20 so go right21 < 23 so go left21 = 21 found it!
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right21 < 23 so go left
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right21 < 23 so go left
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right21 < 23 so go left21 = 21 found it!
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 21 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right21 < 23 so go left21 = 21 found it!
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
now delete it!
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .
21 < 27 so go left21 > 20 so go right21 < 23 so go left21 = 21 found it!
this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
now delete it!
DELETE(21)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
INSERT(62)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
INSERT(62)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
INSERT(62)
Binary Search Trees
35
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
INSERT(62)
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
INSERT(62)
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
Recall that in a binary search tree, for any node
- all the nodes in the left subtree have smaller keys
- all the nodes in the right subtree have larger keys
We perform a FIND operation by following a path from the root. . .this takes O(h) time - where h is the height
h
The INSERT and DELETE operations are similar and also take O(h) time
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
How big is h?
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
How big is h?
n is the numberof elements
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
Binary Search Trees
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
h
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
In particular, each INSERT could increase h by one
Binary Search Trees
63
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
In particular, each INSERT could increase h by one
h
Binary Search Trees
63
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
64
In particular, each INSERT could increase h by one
h
Binary Search Trees
63
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
64
In particular, each INSERT could increase h by one
h
Binary Search Trees
63
6235
A classic choice for a dynamic search structure isa binary search tree. . .
key
27
20 36
15 23 31 61
16 26
How big is h?
It might be as small as log2 n (if the tree is perfectly balanced)
n is the numberof elements
but it might be as big as n (if the tree is completely unbalanced)
64
In particular, each INSERT could increase h by one
h
how can we overcome this?
Part one
Self-balancing trees
inspired by slides by Inge Li Gørtzin turn inspired by slides by Kevin Wayne
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
2-node
2-3-4 Trees
11 18
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
3-node
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
4-node
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-node
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-node
smaller than 24
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-node
smaller than 24
bigger than 24
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-3-4 Trees
11 18
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
3-node
2-3-4 Trees
11 18
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
3-node
smaller than 11
2-3-4 Trees
11 18
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
3-node
smaller than 11 bigger than 18
2-3-4 Trees
11 18
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
3-node
smaller than 11 bigger than 18between 11 and 18
2-3-4 Trees
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
4-node
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
4-node
smaller than 2
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
4-node
smaller than 2
between 2 and 4
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
4-node
smaller than 2
between 2 and 4 between 4 and 6
2-3-4 Trees
2 4 6
Key idea: Nodes can have between 2 and 4 children (hence the name)
Perfect balance - every path from the root to a leaf has the same length(always, all the time)
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
2-node: 2 children and 1 key3-node: 3 children and 2 keys4-node: 4 children and 3 keys
The are “dummy leaves” (they don’t do or contain anything)
Like in a binary search tree,the keys held at a node determine
the contents of its subtrees
4-node
smaller than 2
between 2 and 4 between 4 and 6
bigger than 6
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13found it!
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13found it!
What is the time complexity of the FIND operation?
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13found it!
What is the time complexity of the FIND operation?
It’s O(h) again
h
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13found it!
What is the time complexity of the FIND operation?
It’s O(h) again
h
(each step down the path takes O(1) time)
The FIND operation
25 261 3 5 12 14
1424
19 227 10 317
2 4 6 13 15
11 18
we perform a FIND operation by following a path from the root. . .Just like in a binary search tree,
12 is between 11 and 18 FIND(12)
descisions are made by inspecting the key(s) at the current nodeand following the appropriate edge
12 is smaller than 13found it!
What is the time complexity of the FIND operation?
It’s O(h) again
h
(each step down the path takes O(1) time)What is the height, h of a 2-3-4 tree?
The height of a 2-3-4 tree
Perfect balance - every path from the root to a leaf has the same length(we’ll justify this as we go along)
This implies that the height, h of a 2-3-4 tree with n nodes is
Worst case: log2 n (all 2-nodes)
Best case: log4 n =log2 n
2 (all 4-nodes)
h is between 10 and 20 for a million nodes
( is an element)
The height of a 2-3-4 tree
Perfect balance - every path from the root to a leaf has the same length(we’ll justify this as we go along)
This implies that the height, h of a 2-3-4 tree with n nodes is
Worst case: log2 n (all 2-nodes)
Best case: log4 n =log2 n
2 (all 4-nodes)
h is between 10 and 20 for a million nodes
The time complexity of the FIND operation is O(h)
( is an element)
The height of a 2-3-4 tree
Perfect balance - every path from the root to a leaf has the same length(we’ll justify this as we go along)
This implies that the height, h of a 2-3-4 tree with n nodes is
Worst case: log2 n (all 2-nodes)
Best case: log4 n =log2 n
2 (all 4-nodes)
h is between 10 and 20 for a million nodes
( is an element)
The time complexity of the FIND operation is O(h) = O(logn)
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
To perform INSERT(x, k),
11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
INSERT(x, 16)11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
INSERT(x, 16)11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
INSERT(x, 16)11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
INSERT(x, 16)11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
INSERT(x, 16)11 18
17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
INSERT(x, 16)11 18
16 17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
The INSERT operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
The INSERT operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
INSERT(x, 9)
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
The INSERT operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
The INSERT operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
The INSERT operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
The INSERT operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
The INSERT operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
The INSERT operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
Step 4: If the leaf is a 4-node,
The INSERT operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
Step 4: If the leaf is a 4-node, ???
The INSERT operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
Step 4: If the leaf is a 4-node, ??? We will make sure this never happens
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 9232 51
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 9232 51
BEFORE
AFTER
71
86
9232 51
41 63
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 9232 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
9232 51
41 63
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 92
these subtrees could have any size
32 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
9232 51
41 63
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 92
these subtrees could have any size
32 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
92
these subtrees haven’t changed
32 51
41 63
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 92
these subtrees could have any size
32 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
92
these subtrees haven’t changed
32 51
41 63
no path lengths have changed
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 92
these subtrees could have any size
32 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
92
these subtrees haven’t changed
32 51
41 63
no path lengths have changed
(if it was perfectly balanced, it still is)
SPLITTING 4-nodes
We can SPLITany 4-node into two 2-nodesif it’s parent isn’t a 4-node
41 63
71 86 92
these subtrees could have any size
32 51
BEFORE
AFTER
The extra key is pushed up to the parent(so it won’t work if the parent is a 4-node)
71
86
92
these subtrees haven’t changed
32 51
41 63
no path lengths have changed
(if it was perfectly balanced, it still is)
SPLIT takes O(1) time
The INSERT operation
25 261 3 12 14
1424
19 22
2 4 6
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
SPLIT 4-nodes as we go down
5
13 15
The INSERT operation
25 261 3 12 14
1424
19 22
2 4 6
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
5
13 15
The INSERT operation
25 261 3 12 14
1424
19 22
2 4 6
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
5
13 15
The INSERT operation
25 261 3 12 14
1424
19 22
2 4 6
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
5
13 15
The INSERT operation
25 261 3 12 14
1424
19 22
2 4 6
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
SPLIT this!
5
13 15
The INSERT operation
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
11 18
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4
SPLIT this!
5
13 15
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18SPLIT this!
5
13 15
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18SPLIT this!
5
13 15
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18
5
13 15
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18
5
13 15
The INSERT operation
7 9 10
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18
5
13 15
The INSERT operation
7 9 10
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
7 9 10
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18SPLIT this!
5
13 15
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
2 6
4 11 18SPLIT this!
9
75 10
13 15
The INSERT operation
6 9
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
SPLIT this!
2
4 11 18
6 9
75 10
13 15
The INSERT operation
6 9
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
2
4 11 18
6 9
75 10
13 15
The INSERT operation
6 9
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
2
4 11 18
6 9
75 10
13 15
The INSERT operation
6 9
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
The INSERT operation
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
INSERT(x, 8)
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
The INSERT operation
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
The INSERT operation
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
OK, one more thing. . .
The INSERT operation
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
OK, one more thing. . .
INSERT(x, 20)
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
OK, one more thing. . .
INSERT(x, 20)
The INSERT operation
4 11 18
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
2
4 11 18
6 9
5
13 15
107 8
OK, one more thing. . .
INSERT(x, 20)
what happens when we SPLIT the root?
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
5
13 15
107 8
OK, one more thing. . .
INSERT(x, 20)
what happens when we SPLIT the root?
184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 22
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the leaf is a 2-node,insert (x, k), converting it into a 3-node
16 17
Step 3: If the leaf is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
5
13 15
107 8
OK, one more thing. . .
INSERT(x, 20)
what happens when we SPLIT the root?
184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 2216 175
13 15
107 8
INSERT(x, 20)184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 2216 175
13 15
107 8
INSERT(x, 20)
SPLITTING the root increases the height of the treeand increases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 2216 175
13 15
107 8
INSERT(x, 20)
SPLITTING the root increases the height of the treeand increases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
This is the only way INSERT can affect the length of pathsso it also maintains the perfect balance property
184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 2216 175
13 15
107 8
INSERT(x, 20)
SPLITTING the root increases the height of the treeand increases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
This is the only way INSERT can affect the length of pathsso it also maintains the perfect balance property
As each SPLIT takes O(1) time, overall INSERT takes O(logn) time
184
11
The INSERT operation
2 6 9
25 261 3 12 14
1424
19 2216 175
13 15
107 8
INSERT(x, 20)
As each SPLIT takes O(1) time, overall INSERT takes O(logn) time
184
11
Step 1: Search for the key k as if performing FIND(k).
To perform INSERT(x, k),
Step 2: If the bottom node is a 2-node,insert (x, k), converting it into a 3-node
Step 3: If the bottom node is a 3-node,insert (x, k), converting it into a 4-node
SPLIT 4-nodes as we go down
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
DELETE(16)11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
DELETE(16)11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
DELETE(16)11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
DELETE(16)11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
DELETE(16)11 18
16 177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
DELETE(16)11 18
177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
177 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
7 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
7 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
7 9 10
The DELETE operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
7 9 10
The DELETE operation
7 9 10 25 261 3 5 12 14
1424
19 22
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
7 9 10
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
DELETE(9)
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
Step 4: If the leaf is a 2-node,
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
Step 4: If the leaf is a 2-node, ???
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
2 4 6 13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
Step 4: If the leaf is a 2-node, ??? We will make sure this never happens
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node71
86
92
41 63
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
71
86
92
41 63
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
41 63
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
41 63
This is the opposite of aSPLIT operation
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
these subtrees haven’t changed
41 63
This is the opposite of aSPLIT operation
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
these subtrees haven’t changed
41 63
no path lengths have changed
This is the opposite of aSPLIT operation
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
these subtrees haven’t changed
41 63
no path lengths have changed
(if it was perfectly balanced, it still is)
This is the opposite of aSPLIT operation
into a 4-node
FUSING 2-nodes
We can FUSE two 2-nodes (with the same parent)
if that parent isn’t a 2-node
41 63
71 86 92
BEFORE
AFTER
The extra key is pulled down from the parent(so it won’t work if the parent is a 2-node)
71
86
92
these subtrees haven’t changed
41 63
no path lengths have changed
(if it was perfectly balanced, it still is)
This is the opposite of aSPLIT operation
FUSE takes O(1) time
into a 4-node
TRANSFERING keys
If there is a 2-node and a 3-node(with the same parent)
we can perform a TRANSFER71
8641 63
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTER
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63 91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63 91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63
these subtrees haven’t changed
91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
no path lengths have changed
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63
these subtrees haven’t changed
91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
no path lengths have changed
(if it was perfectly balanced, it still is)
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63
these subtrees haven’t changed
91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
no path lengths have changed
(if it was perfectly balanced, it still is)
TRANSFER takes O(1) time
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63
these subtrees haven’t changed
91
978671
91 97(even if the parent is the root)
TRANSFERING keys
If there is a 2-node and a 3-node
BEFORE
AFTERThe keys have been rearranged
no path lengths have changed
(if it was perfectly balanced, it still is)
TRANSFER also works with a 2-node and a 4-node
TRANSFER takes O(1) time
(with the same parent)
we can perform a TRANSFER71
8641 63
41 63
these subtrees haven’t changed
91
978671
91 97(even if the parent is the root)
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
use FUSE and TRANSFER to convert 2-nodes as we go down
2 4 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
2 4 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
2 4 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
2 4 6
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
2 4 6
The DELETE operation
5 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
2 4 6
The DELETE operation
3 5 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
2 4 6
The DELETE operation
3 5 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
3 5
2 4 6
The DELETE operation
3 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
3 5
2 4 6
The DELETE operation
3 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
3 5
2 6
4
The DELETE operation
3 25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
3 54
2 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
FUSE this!
3 54
2 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
3 54
2 6
The DELETE operation
25 261 3 5 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
3 54
2 6
Now we can DELETE the 5
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
DELETE(5)
use FUSE and TRANSFER to convert 2-nodes as we go down
2 6
Now we can DELETE the 5
3 4
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
use FUSE and TRANSFER to convert 2-nodes as we go down
2 6
3 4
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
use FUSE and TRANSFER to convert 2-nodes as we go down
2 6
3 4
OK, one more thing. . .
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
use FUSE and TRANSFER to convert 2-nodes as we go down
2 6
3 4
OK, one more thing. . . what happens when we FUSE the root?
FUSING the root
FUSING the root can decrease the height of the treewhich in turn decreases the length of all root-leaf paths by one
71 92
We said that we could only FUSE two 2-nodes if the parent was not a 2-node. . .we make an exception for the root
83root
71 92 fused root83
FUSING the root
FUSING the root can decrease the height of the treewhich in turn decreases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
71 92
We said that we could only FUSE two 2-nodes if the parent was not a 2-node. . .we make an exception for the root
83root
71 92 fused root83
FUSING the root
FUSING the root can decrease the height of the treewhich in turn decreases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
This is the only way DELETE can affect the length of pathsso it also maintains the perfect balance property
71 92
We said that we could only FUSE two 2-nodes if the parent was not a 2-node. . .we make an exception for the root
83root
71 92 fused root83
FUSING the root
FUSING the root can decrease the height of the treewhich in turn decreases the length of all root-leaf paths by one
- i.e every path from the root to a leaf has the same lengthSo it maintains the perfect balance property
This is the only way DELETE can affect the length of pathsso it also maintains the perfect balance property
As each FUSE or TRANSFER takes O(1) time, overall DELETE takes O(logn) time
71 92
We said that we could only FUSE two 2-nodes if the parent was not a 2-node. . .we make an exception for the root
83root
71 92 fused root83
The DELETE operation
As each FUSE or TRANSFER takes O(1) time, overall DELETE takes O(logn) time
25 261 12 14
1424
19 227 10
13 15
Step 1: Search for the key k using FIND(k).
To perform DELETE(k) on a leaf (we’ll deal with other nodes later)
Step 2: If the leaf is a 3-node,delete (x, k), converting it into a 2-node
11 18
17
Step 3: If the leaf is a 4-node,delete (x, k), converting it into a 3-node
use FUSE and TRANSFER to convert 2-nodes as we go down
2 6
3 4
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
DELETE(11)
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
DELETE(11)
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
DELETE(11)
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
DELETE(11)
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
DELETE(11)
10 is the predecessor of 11
The DELETE operation
25 261 12 14
1424
19 227 10
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
DELETE(11)
10 is the predecessor of 11
The DELETE operation
7 25 261 12 14
1424
19 22
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
DELETE(11)
10 is the predecessor of 11
7 10
The DELETE operation
7 25 261 12 14
1424
19 22
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′
DELETE(11)
10 is the predecessor of 11
7 10
The DELETE operation
7 25 261 12 14
1424
19 22
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′
DELETE(11)
7 10
The DELETE operation
25 261 12 14
1424
19 22
13 15
11 18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′
DELETE(11)
7 10
The DELETE operation
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′
DELETE(11)
7
10
The DELETE operation
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′
7
10
The DELETE operation
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4
What if we want to DELETE something other than a leaf?
Step 1: Find the PREDECESSOR of k (this is essentially the same as FIND)
- that’s the element with the largest key k′such that k′ < k
Step 2: Call DELETE(k′)- fortunately k′ is always a leaf
Step 3: Overwrite k with another copy of k′ This also takes O(logn) time
7
10
2-3-4 tree summary
A 2-3-4 is a data structure based on a tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4 7
10
2-3-4 tree summary
A 2-3-4 is a data structure based on a tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4 7
10
Unfortunately, 2-3-4 trees are awkward to implementbecause the nodes don’t all have the same number of children
2-3-4 tree summary
A 2-3-4 is a data structure based on a tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
25 261 12 14
1424
19 22
13 15
18
17
2 6
3 4 7
10
Unfortunately, 2-3-4 trees are awkward to implementbecause the nodes don’t all have the same number of children
So, what is used in practice?
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
51 53 5556 9
55 57
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
51 53 5556 9
55 57
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
All root-to-leaf paths have the same number of black nodes
51 53 5556 9
55 57
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
All root-to-leaf paths have the same number of black nodes
Red nodes cannot have red children
51 53 5556 9
55 57
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
All root-to-leaf paths have the same number of black nodes
Red nodes cannot have red children
51 53 5556 9
55 57
If these are used in practice, why did you waste our time with 2-3-4 trees?
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
All root-to-leaf paths have the same number of black nodes
Red nodes cannot have red children
51 53 5556 9
55 57
If these are used in practice, why did you waste our time with 2-3-4 trees?
1. 2-3-4 trees are conceptually much nicer
Red-Black tree summary
A Red-Black tree is a data structure based on a binary tree structure
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes worst case O(logn) time
4
52 58
The root is black
All root-to-leaf paths have the same number of black nodes
Red nodes cannot have red children
51 53 5556 9
55 57
If these are used in practice, why did you waste our time with 2-3-4 trees?
1. 2-3-4 trees are conceptually much nicer 2. they are secretly the same :)
2-3-4 trees vs. Red-Black trees
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
2-3-4 trees vs. Red-Black trees
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
2-3-4 trees vs. Red-Black trees
1 2 3
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
2-3-4 trees vs. Red-Black trees
5 6 71 2 3
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
2-3-4 trees vs. Red-Black trees
95 6 71 2 3
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
2-3-4 trees vs. Red-Black trees
95 6 71 2 3
Any 2-3-4 tree can be converted into a Red-Black tree (and visa-versa)
The operations on 2-3-4 trees also have equivalent operations on a Red-Black tree
(the details of the Red-Black tree operations are in CLRS Chapter 13)
4
52 58
51 53 5556 9
55 57
2. they are secretly the same :)
4 8
1 2 3 5 6 7 9
You can think of a Red-Black tree asa way to implement a 2-3-4 tree
Dynamic Search Structure Summary
Binary Search Tree
Unsorted Linked List
INSERT DELETE FIND
O(1) O(n) O(n)
DELETE FIND
A dynamic search structure supports (at least) the following three operations
DELETE(k) - deletes the (unique) element x with x.key = k
INSERT(x, k) - inserts x with key k = x.key
FIND(k) - returns the (unique) element x with x.key = k
Here are the worst case time complexities of the structures we have seen. . .
O(logn) O(logn) O(logn)2-3-4 Tree
Red-Black Tree O(logn) O(logn) O(logn)
O(n) O(n) O(n)
End of part one
Part two
Skip lists
inspired by slides by Ashley Montanaro
Dynamic Search Structures
A dynamic search structure,
Each element x must have a unique key - x.key
The following operations are supported:
DELETE(k) - deletes the (unique) element x with x.key = k
INSERT(x, k) - inserts x with key k = x.key
FIND(k) - returns the (unique) element x with x.key = k
(or reports that it doesn’t exist)
stores a set of elements
(or reports that it doesn’t exist)
We would also like it to support:
PREDECESSOR(k) - returns the (unique) element xwith the largest key such that x.key < k
RANGEFIND(k1, k2) - returns every element x with k1 6 x.key 6 k2
Using a Linked List as a Dynamic Search Structure (again)
1
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
1
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
11
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
5211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
55211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
555211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
5555211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
Using a Linked List as a Dynamic Search Structure (again)
5555211
dynamic search structureEarlier we briefly considered using an unsorted Linked List as a
What about using a sorted Linked List?
key
2
The bottleneck is FIND, which is very inefficient,
INSERT and DELETE also take O(n) time but only because they rely on FIND
(in the worst case)
How can we speed up the FIND operation?
- we have to look through the entire linked list to find an item
FIND(18)
5 9 16 18 25
found it!
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16 18 25
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
Making Shortcuts
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
Making Shortcuts
1
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
Making Shortcuts
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9
Making Shortcuts
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9 18 < 25
Making Shortcuts
9
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9 18 < 25
Making Shortcuts
169
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9 18 < 25
Making Shortcuts
16169
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9 18 < 25
Making Shortcuts
16169
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
18 > 9 18 < 25
found it!
Making Shortcuts
16169
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
How long does this take?
18 > 9 18 < 25
found it!
Making Shortcuts
16169
91
How about adding some shortcuts?
1 2 5 9 16
1 9
18 25
25
We’ve attached a second linked list containing only some of the keys. . .
To perform FIND(k) we start in the top listand go right until we come to a key k′ > k
then we move down to the bottom listand go right until we find k
FIND(18)
How long does this take?
18 > 9 18 < 25
found it!
That depends on where we place the shortcuts
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
finding this is slowfinding this is quick
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
finding this is quickfinding this is slow
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
If we spread out the m keys in the top list evenly . . .
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
If we spread out the m keys in the top list evenly . . .
the worst case time for a FIND operation becomes O(m+ n/m)
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
If we spread out the m keys in the top list evenly . . .
the worst case time for a FIND operation becomes O(m+ n/m)
m
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
If we spread out the m keys in the top list evenly . . .
the worst case time for a FIND operation becomes O(m+ n/m)
≈ nm ≈ n
m ≈ nm
m
Linked Lists with two levels
Imagine that we decide to place m keys in the top list. . .
where should we put them to minimisethe worst case time for a FIND operation?
(the bottom list always contains all n keys)
If we spread out the m keys in the top list evenly . . .
the worst case time for a FIND operation becomes O(m+ n/m)
≈ nm ≈ n
m ≈ nm
m
By setting m =√n, we get
the worst case time for a FIND operation is O(√n)
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
They are chosen to be as evenly spread as possible
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
1 16 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
1 16 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
1 16 38
1 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
1 5 16 25 31 38
1 16 38
1 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
The bottom level contains every key
and every level contains the leftmost and rightmost keys
1 5 16 25 31 38
1 16 38
1 38
Each level will now contain half of the keys (rounding up) from the level below
Linked Lists with many levels
How about adding even more lists? (each list is called a level)
1 2 5 9 16 18 25 27 31 35 38
They are chosen to be as evenly spread as possible
The bottom level contains every key
and every level contains the leftmost and rightmost keys
As each level contains half of the keys from the level below,there are O(logn) levels
1 5 16 25 31 38
1 16 38
1 38
Each level will now contain half of the keys (rounding up) from the level below
FIND in multi-level linked lists
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
27 31 35 38
FIND in multi-level linked lists
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
27 31 35 38
FIND in multi-level linked lists
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
27 31 35 38
FIND in multi-level linked lists
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
27 31 35 38
FIND in multi-level linked lists
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
27 31 35 38
FIND in multi-level linked lists
1
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
27 31 35 38
FIND in multi-level linked lists
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35
27 31 35 38
FIND in multi-level linked lists
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
27 31 35 38
FIND in multi-level linked lists
16
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
27 31 35 38
FIND in multi-level linked lists
2516
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
25 6 35
27 31 35 38
FIND in multi-level linked lists
312516
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
25 6 35 31 6 35
27 31 35 38
FIND in multi-level linked lists
312516
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
25 6 35 31 6 35
27 31 35 38
FIND in multi-level linked lists
31
312516
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
25 6 35 31 6 35
27 31 35 38
FIND in multi-level linked lists
3531
312516
161
1
1 2 5 9 16 18 25
1 5 16 25 31 38
1 16 38
1 38
How do we perform FIND(k) in multi-level linked list?(essentially just like before)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
ElseMove down
consider FIND(35)
38 > 35
16 6 35 38 > 35
25 6 35 31 6 35
27 31 35 38
35 = 35!
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
k′ > k
The complexity of FIND
How long does FIND(k) take in a multi-level linked list?
Observation 1 We only move down at most O(logn) times
because there are only O(logn) levels
Observation 2 Between any two nodes on level i,there are at most 2 nodes on level i+ 1
because we took half the nodes and spread them evenly
level i+ 1
level i
Observation 3 We only move right at most 2 times on any level i+ 1because we stopped moving right on level i
k′
k′
k′ > k
k′ > k
Fact We only move at most O(logn) times while performing a FIND
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
How are we going to do INSERTS and DELETES?
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
How are we going to do INSERTS and DELETES?
Which levels should we put an INSERTED key into?
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
How are we going to do INSERTS and DELETES?
Which levels should we put an INSERTED key into?
How can we keep a good spread of keys at each levels?
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
How are we going to do INSERTS and DELETES?
Which levels should we put an INSERTED key into?
How can we keep a good spread of keys at each levels?
especially when we don’t know what will be INSERTED and DELETED in the future
Multi-level Linked Lists
1 2 5 9 16 18 25 27 31 35 38
1 5 16 25 31 38
1 16 38
1 38
If we had a multi-level linked list with O(logn) levels
and the keys were evenly spread as possiblewhere each level contained half of the keys from the level below
then we could perform FIND in O(logn) time
How are we going to do INSERTS and DELETES?
Which levels should we put an INSERTED key into?
How can we keep a good spread of keys at each levels?
especially when we don’t know what will be INSERTED and DELETED in the future
If you can’t get organised,get randomised1
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
H T H TH T HT H TT TT TT H
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
T T TT TT TT TT1 5 9 25 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
1 5 9 25 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
1 5 9 25 38
H TH HT
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
1 5 9 25 38
T1 9 38T
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
1 5 9 25 38
1 9 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
1 5 9 25 38
1 9 38
H HT
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
H H H HH H1 5 9 25 38
H H H1 9 38
H HT1 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
Flip one coin for each key. . .
For each key that got a head, put it in the new top level
Repeat with the keys from the new top level(stop when the top level contains only the smallest and largest keys)
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
This doesn’t look quite perfect but actually, it’s very good with high probability(more on this later)
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
This doesn’t look quite perfect but actually, it’s very good with high probability(more on this later)
The intuition is that n coin flips contain about n2 heads and about n
2 tails
Building Multi-level Linked Lists by flipping coins
1 2 5 9 16 18 25 27 31 35 38
Before we formally introduce Skip Lists, we let’s rewindand try building another Multi-level Linked List. . .
by flipping coins
(we still always include the smallest and largest keys in every level)
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
This doesn’t look quite perfect but actually, it’s very good with high probability(more on this later)
The intuition is that n coin flips contain about n2 heads and about n
2 tails
and the heads are roughly evenly spread out
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop(if there is no ‘next level up’, create a new level at the top)
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
1
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
9
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
9
9
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
169
9
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
16169
9
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
16169
9
91
1
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
1 2 5 9 16 18 25 27 31 35 38
H H H HH H1 5 9 25 38
H H H1 9 38
H H1 38
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
16169
9
91
1
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
25 27 31 35 38
HH H25 38
H38
H38
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
25
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
16169
9
91
1
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
25 27 31 35 38
HH H25 38
H38
H38
19
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
25
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
16169
9
91
1
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
25 27 31 35 38
HH H25 38
H38
H38
19
H
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
19
25
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
16169
9
91
1
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
25 27 31 35 38
HH H25 38
H38
H38
19
H19
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
19
25
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
16169
9
91
1
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
25 27 31 35 38
HH H25 38
H38
H38
19
H19
T
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
consider INSERT(x, 19)
19 goes in here
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
A skip list is a multi-level linked list wherethe INSERTS are done by flipping coins
i.e. this is a skip list. . .
To perform INSERT(x, k),
Step 1: Use FIND(k) to insert (x, k) into the bottom level
Step 2: Flip a coin repeatedly:
If you get a heads, insert (x, k) into the next level up
If you get a tails, stop
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
(if there is no ‘next level up’, create a new level at the top)
Skip Lists
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
Skip Lists
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
Skip Lists
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
1
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
1
1
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
91
1
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
9
9
H9
91
1
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
9
9
H9
91
1
That about DELETES?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Skip Lists
That about DELETES?
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 16 18
H H1 5
H1
H1
Skip Lists
That about DELETES?
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 16 18
H H1 5
H1
H1
Step 3: Remove any empty levels(ones containing only the smallest and largest keys)
Skip Lists
That about DELETES?
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
consider DELETE(x, 9)
Step 3: Remove any empty levels(ones containing only the smallest and largest keys)
25 27 31 35 38
HH H25 38
H38
19
H19
1 2 5 16 18
H H1 5
H1
Skip Lists
That about DELETES?
DELETING is straightforward, just FIND the key and DELETE it from all levels
To perform DELETE(k),
Step 1: Use FIND(k) to find (x, k)
Step 2: Delete (x, k) from all levels
Step 3: Remove any empty levels(ones containing only the smallest and largest keys)
25 27 31 35 38
HH H25 38
H38
19
H19
1 2 5 16 18
H H1 5
H1
Skip Lists (pre-proof) summary
25 27 31 35 38
HH H25 38
H38
19
H19
1 2 5 16 18
H H1 5
H1
A skip list is a randomised data structure, based on link lists with shortcuts
which supports INSERT(x, k), FIND(k) and DELETE(k)
We will show that each of these operations takes expected O(logn) time
That is, they take O(logn) time ‘on average’
Important There is no randomness in the data,
On the worst case input sequence, the expected time is O(logn)
the only randomness is in the coin flips
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 1 level is 12
(the first coin flip is H)
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 1 level is 12
(the first coin flip is H)
The probability (x, k) is inserted into more than 2 levels is 14
(we throw HH. . . )
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 1 level is 12
(the first coin flip is H)
The probability (x, k) is inserted into more than 2 levels is 14
(we throw HH. . . )
The probability (x, k) is inserted into more than 3 levels is 18
(we throw HHH. . . )
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 1 level is 12
(the first coin flip is H)
The probability (x, k) is inserted into more than 2 levels is 14
(we throw HH. . . )
The probability (x, k) is inserted into more than 3 levels is 18
(we throw HHH. . . )
The probability (x, k) is inserted into more than j levels is 12j
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than j levels is 12j
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n = 1
n2
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n = 1
n2
The union bound
Let E1, E2 . . . En be events where Ej occurs with probability pj
The probability of at least one Ej occuring is at most∑
j pj
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n = 1
n2
The union bound
Let E1, E2 . . . En be events where Ej occurs with probability pj
The probability of at least one Ej occuring is at most∑
j pj
Let Ej be the event that the j-th INSERT puts its element in more than 2 logn levels
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n = 1
n2
The union bound
Let E1, E2 . . . En be events where Ej occurs with probability pj
The probability of at least one Ej occuring is at most∑
j pj
Let Ej be the event that the j-th INSERT puts its element in more than 2 logn levels
The probability of at least one Ej occuring is at most∑
j1n2
How many levels are in a Skip list?
We begin by proving that after n INSERT operations, a skip listis very unlikely to have more than 2 logn levels. . .
Consider some INSERT(x, k) operation
An empty skip list contains only one leveland the only way this can increase is during an INSERT operation
The probability (x, k) is inserted into more than 2 logn levels is 122 log n = 1
n2
The union bound
Let E1, E2 . . . En be events where Ej occurs with probability pj
The probability of at least one Ej occuring is at most∑
j pj
Let Ej be the event that the j-th INSERT puts its element in more than 2 logn levels
The probability of at least one Ej occuring is at most∑
j1n2 = 1
n
How many levels are in a Skip list?
After n INSERT operations, the probability that a skip list
has more than 2 logn levels. . .
is at most1n
How many levels are in a Skip list?
After n INSERT operations, the probability that a skip list
has more than 2 logn levels. . .
is at most1n
It gets better as n increases!
So how long does a FIND take? (sketch proof)
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
1
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
9
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
25
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
2725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
312725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
35312725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
Start at the top-left (the head of the top level)
To perform FIND(k),While you haven’t found k:
If the node to the right’s key, k′ 6 kMove right
Else Move down
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
35312725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
consider FIND(35)
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
35312725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
consider FIND(35)
How long is this path?
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
35312725
25199
H91
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
consider FIND(35)
How long is this path?
1. Reverse it
HH H25 38
H38
H38
H19H H H1 5 9
H H1 9
H1
25 27 31 35 381 2 5 9 16 18 19
So how long does a FIND take? (sketch proof)
25 27 31 35
25199
1 9
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1consider FIND(35)
How long is this path?
1. Reverse it
So how long does a FIND take? (sketch proof)
25 27 31 35
25199
1 9
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1consider FIND(35)
How long is this path?
1. Reverse it2. Convince yourself this is the same path:
Start at k
While not at the top-left:
If you can,Move up
Else Move left
So how long does a FIND take? (sketch proof)
25 27 31 35
25199
1 9
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1consider FIND(35)
How long is this path?
1. Reverse it2. Convince yourself this is the same path:
Start at k
While not at the top-left:
If (flip a coin)Move up
Else Move left
3. Now convince yourselfit takes the same time as this:
(in expectation)
So how long does a FIND take? (sketch proof)
25 27 31 35
25199
1 9
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1consider FIND(35)
How long is this path?
1. Reverse it2. Convince yourself this is the same path:
Start at k
While not at the top-left:
If (flip a coin)Move up
Else Move left
3. Now convince yourselfit takes the same time as this:
T
T T
T T T
(in expectation)
So how long does a FIND take? (sketch proof)
25 27 31 35
25199
1 9
1
As the number of levels is O(logn) (with high probability),
we can conclude that the number of times we move down is very likely to be O(logn)
but how many times do we move right?
25 27 31 35 38
HH H25 38
H38
H38
19
H19
1 2 5 9 16 18
H H H1 5 9
H H1 9
H1consider FIND(35)
How long is this path?
1. Reverse it2. Convince yourself this is the same path:
Start at k
While not at the top-left:
If (flip a coin)Move up
Else Move left
3. Now convince yourselfit takes the same time as this:
O(logn) in expectation
T
T T
T T T
(in expectation)
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
as each move takes O(1) time, the expected time complexity is O(logn)
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
as each move takes O(1) time, the expected time complexity is O(logn)
The number of levels is also O(logn) in expectation
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
as each move takes O(1) time, the expected time complexity is O(logn)
The number of levels is also O(logn) in expectation
Both INSERT and DELETE also take expected O(logn) time
this is because they both call FIND and then spend O(1) time per level
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
as each move takes O(1) time, the expected time complexity is O(logn)
The number of levels is also O(logn) in expectation
Both INSERT and DELETE also take expected O(logn) time
this is because they both call FIND and then spend O(1) time per level
In fact, all three operations actually take O(logn) timewith high probability
i.e. the probability of an operation taking longer is at most 1n
Time complexities
When performing a FIND operation, the number of moves is O(logn) in expectation
as each move takes O(1) time, the expected time complexity is O(logn)
The number of levels is also O(logn) in expectation
Both INSERT and DELETE also take expected O(logn) time
this is because they both call FIND and then spend O(1) time per level
In fact, all three operations actually take O(logn) timewith high probability
i.e. the probability of an operation taking longer is at most 1n
(this is a stronger claim but proving it is harder)
Skip Lists (post-proof) summary
25 27 31 35 38
HH H25 38
H38
19
H19
1 2 5 16 18
H H1 5
H1
A skip list is a randomised data structure, based on link lists with shortcuts
which supports INSERT(x, k), FIND(k) and DELETE(k)
each of these operations takes expected O(logn) time
That is, they take O(logn) time ‘on average’
Important There is no randomness in the data,
On the worst case input sequence, the expected time is O(logn)
the only randomness is in the coin flips
Dynamic Search Structure Summary
Binary Search Tree
Unsorted Linked List
INSERT DELETE FIND
O(1) O(n) O(n)
DELETE FIND
A dynamic search structure supports (at least) the following three operations
DELETE(k) - deletes the (unique) element x with x.key = k
INSERT(x, k) - inserts x with key k = x.key
FIND(k) - returns the (unique) element x with x.key = k
Here are the time complexities of the structures we have seen. . .
O(logn) O(logn) O(logn)2-3-4 Tree
Red-Black Tree O(logn) O(logn) O(logn)
O(n) O(n) O(n)
Skip list O(logn) O(logn) O(logn)
The time complexities for the Skip list are expected, for the others, they are worst case
![IN4325 - GitHub PagesBoolean retrieval over posting lists Skip pointers (created at indexing time) ... (self-balancing search tree with #children in [a,b]) a-h i-p q-z a-b c-d e-f](https://img.pdfslide.us/doc/110x75/5f3c16232fbb6b58125e3730/in4325-github-pages-boolean-retrieval-over-posting-lists-skip-pointers-created.jpg)