Splay Trees Binary search trees.

Slides:



Advertisements
Similar presentations
Splay Trees Binary search trees.
Advertisements

AVL Trees binary tree for every node x, define its balance factor
Splay Tree Algorithm Mingda Zhao CSC 252 Algorithms Smith College Fall, 2000.
AVL Trees1 Part-F2 AVL Trees v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.
Heaps1 Part-D2 Heaps Heaps2 Recall Priority Queue ADT (§ 7.1.3) A priority queue stores a collection of entries Each entry is a pair (key, value)
1 AVL Trees (10.2) CSE 2011 Winter April 2015.
© 2004 Goodrich, Tamassia Binary Search Trees   
Binary Search Trees1 Part-F1 Binary Search Trees   
Dynamic Dictionaries Primary Operations:  Get(key) => search  Insert(key, element) => insert  Delete(key) => delete Additional operations:  Ascend()
Red Black Trees Colored Nodes Definition Binary search tree.
AVL trees. AVL Trees We have seen that all operations depend on the depth of the tree. We don’t want trees with nodes which have large height This can.
Bottom-Up Splay Trees–Analysis Actual and amortized complexity of join is O(1). Amortized complexity of search, insert, delete, and split is O(log n).
B + -Trees Same structure as B-trees. Dictionary pairs are in leaves only. Leaves form a doubly-linked list. Remaining nodes have following structure:
Search Trees. Binary Search Tree (§10.1) A binary search tree is a binary tree storing keys (or key-element pairs) at its internal nodes and satisfying.
Balanced Search Trees Problem: Efficiency of BST is related to tree’s height.  search, insert and remove follow a path from root to desired location 
© 2004 Goodrich, Tamassia Binary Search Trees1 CSC 212 Lecture 18: Binary and AVL Trees.
Oct 26, 2001CSE 373, Autumn A Forest of Trees Binary search trees: simple. –good on average: O(log n) –bad in the worst case: O(n) AVL trees: more.
Data Structures Chapter 10: Efficient Binary Search Trees 10-1.
AVL Trees and Heaps. AVL Trees So far balancing the tree was done globally Basically every node was involved in the balance operation Tree balancing can.
Bottom-Up Red-Black Trees Top-down red-black trees require O(log n) rotations per insert/delete. Color flips cheaper than rotations. Priority search trees.
SPLAY TREE The basic idea of the splay tree is that every time a node is accessed, it is pushed to the root by a series of tree rotations. This series.
Leftist Trees Linked binary tree.
File Organization and Processing Week 3
Lec 13 Oct 17, 2011 AVL tree – height-balanced tree Other options:
Red Black Trees Colored Nodes Definition Binary search tree.
Red Black Trees Colored Nodes Definition Binary search tree.
Search Trees.
Splay Trees Binary search trees.
Chapter 10 Search Trees 10.1 Binary Search Trees Search Trees
Chapter 11: Multiway Search Trees
AVL Trees binary tree for every node x, define its balance factor
AVL DEFINITION An AVL tree is a binary search tree in which the balance factor of every node, which is defined as the difference between the heights of.
Chapter 10.1 Binary Search Trees
Red-Black Trees 9/12/ :44 AM AVL Trees v z AVL Trees.
Source: Muangsin / Weiss
Heaps © 2010 Goodrich, Tamassia Heaps Heaps
Heaps 9/13/2018 3:17 PM Heaps Heaps.
AVL Trees "The voyage of discovery is not in seeking new landscapes but in having new eyes. " - Marcel Proust.
Lecture 25 Splay Tree Chapter 10 of textbook
Interval Heaps Complete binary tree.
Red-Black Trees 11/13/2018 2:07 AM AVL Trees v z AVL Trees.
(2,4) Trees (2,4) Trees 1 (2,4) Trees (2,4) Trees
B-Trees (continued) Analysis of worst-case and average number of disk accesses for an insert. Delete and analysis. Structure for B-tree node.
Red-Black Trees 11/26/2018 3:42 PM AVL Trees v z AVL Trees.
(2,4) Trees /26/2018 3:48 PM (2,4) Trees (2,4) Trees
Heaps 12/4/2018 5:27 AM Heaps /4/2018 5:27 AM Heaps.
Bottom-Up Splay Trees–Analysis
v z Chapter 10 AVL Trees Acknowledgement: These slides are adapted from slides provided with Data Structures and Algorithms in C++, Goodrich,
(2,4) Trees (2,4) Trees (2,4) Trees.
CMSC 341 Splay Trees.
AVL Trees CSE 373 Data Structures.
AVL Search Tree put(9)
Dynamic Dictionaries Primary Operations: Additional operations:
(2,4) Trees 2/15/2019 (2,4) Trees (2,4) Trees.
(2,4) Trees /24/2019 7:30 PM (2,4) Trees (2,4) Trees
CMSC 341 Splay Trees.
Red-Black Trees 2/24/ :17 AM AVL Trees v z AVL Trees.
(2,4) Trees (2,4) Trees (2,4) Trees.
ITCS6114 Algorithms and Data Structures
(2,4) Trees /6/ :26 AM (2,4) Trees (2,4) Trees
CMSC 341 Splay Trees.
Pairing Heaps Actual Complexity
Red-Black Trees 5/19/2019 6:39 AM AVL Trees v z AVL Trees.
CMSC 341 Splay Trees.
Priority Queues Binary Heaps
Red Black Trees Colored Nodes Definition Binary search tree.
Splay Trees Binary search trees.
Heaps 9/29/2019 5:43 PM Heaps Heaps.
CS210- Lecture 20 July 19, 2005 Agenda Multiway Search Trees 2-4 Trees
CS210- Lecture 19 July 18, 2005 Agenda AVL trees Restructuring Trees
Presentation transcript:

Splay Trees Binary search trees. Search, insert, delete, and split have amortized complexity O(log n) & actual complexity O(n). Actual and amortized complexity of join is O(1). Priority queue and double-ended priority queue versions outperform heaps, deaps, etc. over a sequence of operations. Two varieties. Bottom up. Top down.

Bottom-Up Splay Trees Search, insert, delete, and join are done as in an unbalanced binary search tree. Search, insert, and delete are followed by a splay operation that begins at a splay node. When the splay operation completes, the splay node has become the tree root. Join requires no splay (or, a null splay is done). For the split operation, the splay is done in the middle (rather than end) of the operation.

Splay Node – search(k) 20 10 6 2 8 15 40 30 25 If there is a pair whose key is k, the node containing this pair is the splay node. Otherwise, the parent of the external node where the search terminates is the splay node.

Splay Node – insert(newPair) 20 10 6 2 8 15 40 30 25 If there is already a pair whose key is newPair.key, the node containing this pair is the splay node. Otherwise, the newly inserted node is the splay node.

Splay Node – delete(k) 20 10 6 2 8 15 40 30 25 If there is a pair whose key is k, the parent of the node that is physically deleted from the tree is the splay node. Otherwise, the parent of the external node where the search terminates is the splay node.

Splay Node – split(k) Use the unbalanced binary search tree insert algorithm to insert a new pair whose key is k. The splay node is as for the splay tree insert algorithm. Following the splay, the left subtree of the root is S, and the right subtree is B. S m B m is set to null if it is the newly inserted pair.

Splay Let q be the splay node. q is moved up the tree using a series of splay steps. In a splay step, the node q moves up the tree by 0, 1, or 2 levels. Every splay step, except possibly the last one, moves q two levels up.

Splay Step If q = null or q is the root, do nothing (splay is over). If q is at level 2, do a one-level move and terminate the splay operation. b c a q p p q a b c q right child of p is symmetric.

Splay Step If q is at a level > 2, do a two-level move and continue the splay operation. c d b p gp q a p q a b c gp d q right child of right child of gp is symmetric.

2-Level Move (case 2) q left child of right child of gp is symmetric. b gp p q d p q b c a gp d q left child of right child of gp is symmetric.

Per Operation Actual Complexity Start with an empty splay tree and insert pairs with keys 1, 2, 3, …, in this order. 1 1 2 1 2

Per Operation Actual Complexity Start with an empty splay tree and insert pairs with keys 1, 2, 3, …, in this order. 1 2 3 1 2 3 4 1 2 3

Per Operation Actual Complexity Worst-case height = n. Actual complexity of search, insert, delete, and split is O(n).

Top-Down Splay Trees On the way down the tree, split the tree into the binary search trees S (small elements) and B (big elements). Similar to split operation in an unbalanced binary search tree. However, a rotation is done whenever an LL or RR move is made. Move down 2 levels at a time, except (possibly) in the end when a one level move is made. When the splay node is reached, S, B, and the subtree rooted at the splay node are combined into a single binary search tree.

Split A Binary Search Tree d b A a B c C D f m g E

Split A Binary Search Tree D c d E e m f g

Split A Binary Search Tree D c d E e m f g

Split A Binary Search Tree D c d E e m f g

Split A Binary Search Tree D E d e m f g

Split A Binary Search Tree D d m f g

Split A Binary Search Tree g c D f d m

Two-Level Moves Let m be the splay node. RL move from A to C. g E Let m be the splay node. RL move from A to C. RR move from C to E. L move from E to m.

RL Move B e d b A a c C D f m g E S Some go in S, some in B

Same outcome as in split. RL Move S B A B d c C D f m g E e a b Same outcome as in split.

RR Move S B A B d c C D f m g E e a b All go in S

Outcome is different from split. RR Move S B A B a D b C E c d e m Rotation performed. f g Outcome is different from split.

L Move S B A B a D b C E c d e m f g

L Move S B A B E a D b e C c d m f g

Wrap Up S B m f g A B E a D b e C c d

Wrap Up S B m A B E a D b g e C f c d

Wrap Up m A B E a D b g e C f c d

Bottom Up vs Top Down Top down splay trees are faster than bottom up splay trees.