Scribd
Upload
50 views

CHPT 3 Splay Trees

Splay trees are binary search trees where the node accessed in an operation is rotated to the root of the tree using splay rotations. This summary provides examples of searching and splaying in a splay tree, showing different splaying cases like zig, zig-zig, and zig-zag rotations. It explains that splaying a node moves it to the root in O(h) time, where h is the tree height, but the amortized cost of each operation is O(log n) due to the potential method analysis.

Uploaded by

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

CHPT 3 Splay Trees

Splay trees are binary search trees where the node accessed in an operation is rotated to the root of the tree using splay rotations. This summary provides examples of searching and splaying in a splay tree, showing different splaying cases like zig, zig-zig, and zig-zag rotations. It explains that splaying a node moves it to the root in O(h) time, where h is the tree height, but the amortized cost of each operation is O(log n) due to the potential method analysis.

Uploaded by

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

Splay Trees

v
3

z
4

Splay Trees

Splay Trees are Binary Search Trees


(20,Z)
note that two keys of equal value may be wellseparated all the keys in the blue region are 20 (35,R) (10,A)

BST Rules:

items stored only at internal nodes keys stored at nodes in the left subtree of v are less than or equal to the key stored at v keys stored at nodes in the right subtree of v are greater than or equal to the key stored at v

(7,T) (1,Q)

(14,J)

(21,O)
(36,L)

(37,P) (40,X)

(8,N)

(1,C)

(5,H)

(7,P)

(10,U)

(2,R) (5,I)

(5,G)

An inorder traversal will return the keys in order


Splay Trees

all the keys in the yellow region are 20

(6,Y)

Searching in a Splay Tree: Starts the Same as in a BST


Search proceeds down the tree to found item or an external node. Example: Search for time with key 11.
(1,Q)

(20,Z)

(10,A)

(35,R)

(7,T)

(14,J)

(21,O) (36,L)

(37,P)

(8,N)

(40,X)

(1,C)

(5,H)

(7,P)

(10,U)

(2,R) (5,I)

(5,G) (6,Y)

Splay Trees

Example Searching in a BST, continued


(20,Z)

search for key 8, ends at an internal node.


(7,T) (1,Q)

(10,A)

(35,R)

(14,J)

(21,O) (36,L)

(37,P)

(8,N)

(40,X)

(1,C)

(5,H)

(7,P)

(10,U)

(2,R) (5,I)

(5,G) (6,Y)

Splay Trees

Splay Trees do Rotations after Every Operation (Even Search)


new operation: splay

splaying moves a node to the root using rotations

right rotation

left rotation

makes the left child x of a node y into ys parent; y becomes the right child of x
y a right rotation about y

makes the right child y of a node x into xs parent; x becomes the left child of y
x y a left rotation about x

x x T3 y T1 T2 T1 T2 T1

x
T3 T3

(structure of tree above y is not modified)

T2

T3

(structure of tree above x is not modified)

T1

T2

Splay Trees

Splaying:
start with node x is x the root?
no yes

x is

a left-left grandchild means x is a left child of its parent, which is itself a left child of its parent p is xs parent; g is ps parent
is x a left-left grandchild?
yes

stop

zig-zig
right-rotate about g, right-rotate about p

is x a child of the root?


yes

no

is x a right-right grandchild?
yes

zig-zig
left-rotate about g, left-rotate about p

is x a right-left grandchild? is x the left child of the root?


yes no yes

zig-zag
left-rotate about p, right-rotate about g

zig

zig
left-rotate about the root

is x a left-right grandchild?
yes

zig-zag
right-rotate about p, left-rotate about g
6

right-rotate about the root

Splay Trees

Visualizing the Splaying Cases


z z y y T4 x T3 T1 T2 x y T1 z T2 T3 T4 w T3 T1 T2 x y

zig-zag
z

T1

x T4 T1 T2 T3 T4

zig-zig

T2

T3

zig
x T4 w y

T1

T2

T3

T4

Splay Trees

Splaying Example
(10,A)

(20,Z)

(35,R)

let x = (8,N) x is the right child of its parent, which is the left child of the grandparent left-rotate around p, then rightrotate around g
(20,Z)

g p
(1,Q) (7,T) (14,J) (21,O) (37,P)

1.
(before rotating)

(8,N)

(36,L)

(40,X)

x
(1,C) (5,H) (7,P) (10,U)

(2,R) (5,I)

(5,G) (6,Y) (20,Z)

g
x p
(1,Q) (8,N)

(10,A)

(35,R)

(14,J) (21,O) (10,U) (37,P)

x
p
(1,Q)

(8,N)

(35,R)

g
(7,T)
(36,L) (40,X)

(7,T)

(10,A)

(21,O)

(37,P)

(7,P)

(7,P)

(14,J)

(36,L)

(40,X)

(1,C)

(5,H)

2.
(after first rotation)
(5,G)

(1,C)

(5,H)

(10,U)

3.
(after second rotation)
x is not yet the root, so we splay again 8

(2,R)
(5,I)

(2,R) (6,Y) (5,I)

(5,G) (6,Y)

Splay Trees

Splaying Example, Continued


(20,Z)

now x is the left child of the root right-rotate around root


(35,R)

x
(7,T)

(8,N)

(10,A)

(21,O)

(37,P)

(1,Q)

(7,P)

(14,J)

(36,L)

(40,X)

x
(7,T)

(8,N)

2.
(20,Z)

(1,C)

(5,H)

(10,U)

1.
(2,R) (5,I) (5,G) (6,Y)

(after rotation)
(35,R)

(before applying rotation)


(1,C)

(1,Q)

(7,P)

(10,A)

(5,H)

(14,J)

(21,O)

(37,P)

(2,R) (5,I)

(5,G) (6,Y)

(10,U)

(36,L)

(40,X)

x is the root, so stop


Splay Trees 9

Example Result of Splaying

(20,Z)

(10,A)

(35,R)

before
(7,T) (14,J) (21,O) (8,N) (37,P) (36,L) (40,X)

tree might not be more balanced (1,Q) e.g. splay (40,X) before, the depth of the shallowest leaf is(1,C) (5,H) 3 and the deepest is 7 after, the depth of shallowest leaf is 1 (2,R) and deepest is 8
(5,I) (20,Z)

(7,P)

(10,U)

(5,G) (40,X) (6,Y) (20,Z)

(10,A) (10,A) (40,X) (14,J) (35,R)

(37,P)

(7,T)

(14,J)

(37,P) (1,Q)

(7,T)

(1,Q)

(8,N)

(35,R)

(8,N)

(21,O)

(36,L)

(1,C) (1,C) (5,H) (7,P) (10,U) (21,O) (36,L)

(5,H)

(7,P)

(10,U)

(2,R) (2,R) (5,I) (5,G) (6,Y)

(5,G)

after first splay


(5,I)
(6,Y)

after second splay


10

Splay Trees

Splay Tree Definition


a splay tree is a binary search tree where a node is splayed after it is accessed (for a search or update)

deepest internal node accessed is splayed splaying costs O(h), where h is height of the tree which is still O(n) worst-case
O(h) rotations, each of which is O(1)

Splay Trees

11

Splay Trees & Ordered Dictionaries


which nodes are splayed after each operation?
method findElement splay node if key found, use that node if key not found, use parent of ending external node use the new node containing the item inserted

insertElement

removeElement

use the parent of the internal node that was actually removed from the tree (the parent of the node that the removed item was swapped with)

Splay Trees

12

Amortized Analysis of Splay Trees


Running time of each operation is proportional to time for splaying. Define rank(v) as the logarithm (base 2) of the number of nodes in subtree rooted at v. Costs: zig = $1, zig-zig = $2, zig-zag = $2. Thus, cost for playing a node at depth d = $d. Imagine that we store rank(v) cyber-dollars at each node v of the splay tree (just for the sake of analysis).

Splay Trees

13

Cost per zig


y x T4 w T3 T1 T2 T1 T2 T3 T4 zig x

Doing a zig at x costs at most rank(x) - rank(x): cost = rank(x) + rank(y) - rank(y) - rank(x) < rank(x) - rank(x).
Splay Trees 14

Cost per zig-zig and zig-zag


z y x T3 T1 T2 T4 x

zig-zig
T1 T2

y
z

T3

T4

Doing a zig-zig or zig-zag at x costs at most 3(rank(x) - rank(x)) - 2. Proof: See Theorem 3.9, Page 192.
z y T1 x T4 T1 T2 T3 T4

zig-zag
z

x y

T2

T3 Splay Trees 15

Cost of Splaying
Cost of splaying a node x at depth d of a tree rooted at r:

at most 3(rank(r) - rank(x)) - d + 2: Proof: Splaying x takes d/2 splaying substeps:

cost costi
i 1

d /2

(3( ranki ( x ) ranki 1 ( x )) 2) 2


i 1

d /2

3( rank( r ) rank0 ( x )) 2(d / d ) 2 3( rank( r ) rank( x )) d 2.


Splay Trees 16

Performance of Splay Trees


Recall: rank of a node is logarithm of its size. Thus, amortized cost of any splay operation is O(log n). In fact, the analysis goes through for any reasonable definition of rank(x). This implies that splay trees can actually adapt to perform searches on frequentlyrequested items much faster than O(log n) in some cases. (See Theorems 3.10 and 3.11.)
Splay Trees 17

You might also like