0% found this document useful (0 votes)

21 views18 pages

Splay Trees - Splaying, Insertion and Deletion

Splay trees are self-adjusting binary search trees that reorganize themselves after accessing nodes to optimize access time based on the principle of locality. The document explains the processes of splaying, insertion, and deletion in splay trees, including the necessary rotations and code implementations for these operations. It emphasizes that splay trees may become unbalanced but still provide efficient access to frequently used nodes.

Uploaded by

Arooshi

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

21 views18 pages

Splay Trees - Splaying, Insertion and Deletion

Uploaded by

Arooshi

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 18

2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion

(/)

Introduction (/course/data-structures-introduction/)

Linked Lists (/course/data-structures-linked-lists/)

Doubly Linked Lists (/course/data-structures-doubly-linked-lists/)

Circular Linked Lists (/course/data-structures-circular-linked-lists/)

Stacks (/course/data-structures-stacks/)

Queue (/course/data-structures-queue/)

Trees (/course/data-structures-trees/)

Binary Trees (/course/data-structures-binary-trees/)

Binary Search Trees (/course/data-structures-binary-search-trees/)

Red-Black Trees (/course/data-structures-red-black-trees/)

Red-Black Trees 2 (/course/data-structures-red-black-trees-insertion/)

Red-Black Trees 3 (/course/data-structures-red-black-trees-deletion/)

AVL Trees (/course/data-structures-avl-trees/)

Splay Trees (/course/data-structures-splay-trees/)

Heap (/course/data-structures-heap/)

Priority Queues (/course/data-structures-priority-queues/)

Graph (/course/data-structures-graph/)

Splay Trees
Splay trees are self-adjusting binary search trees i.e., they adjust their nodes after
accessing them. So, after searching, inserting or deleting a node, the tree will get
adjusted. 

https://www.codesdope.com/course/data-structures-splay-trees/ 1/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
Splay trees put the most recently accessed items near the root based on the principle of
locality; 90-10 "rule" which states that 10% of the data is accessed 90% of the time, other
90% of data is only accessed only 10% of the time.

Thus, there is a 90% chance that the elements near the root of a splay tree are going to
be accessed in an operation.

Let's learn how these trees adjust nodes on accessing them.

Splaying

"Splaying" is a process in which a node is transferred to the root by performing suitable

rotations. In a splay tree, whenever we access any node, it is splayed to the root. It will be
clear with the examples given in this chapter.

There are few terminologies used in this process. Let's learn about those.

Zig-Zig and Zig-Zag

When the parent and the grandparent of a node are in the same direction, it is zig-zig.

https://www.codesdope.com/course/data-structures-splay-trees/ 2/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

When the parent and the grandparent of a node are in different directions, it is zig-zag.

Whenever we access a node, we shift it to the root by using suitable rotations. Let's take
the following example.

https://www.codesdope.com/course/data-structures-splay-trees/ 3/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

Here, we have performed a single right rotation and a single rotation is termed as "zig".

"zig-zag" consists of two rotations of the opposite direction. Take a look at the following
example.

Let's take a look at the following example in which we have accessed the node R.

https://www.codesdope.com/course/data-structures-splay-trees/ 4/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

So, we have performed two single rotations of the same direction to bring the node at the
root. This is "zig-zig".

Let's take a look at some examples.


A splay tree is not always a balanced tree and may become unbalanced after some
operations.

Let's write a code to splay a node to the root.

Code for Splaying

We will start by passing the tree (T) and the node which is going to be splayed (n).

SPLAY(T, n)

We have to splay the node n to the root. So, we will use a loop and perform suitable
rotations and stop it when the node n reaches to the root.

SPALY(T, n)
while n.parent != NULL //node is not root
...

Now, if the node n is the direct child of the root, we will just do one rotation, otherwise,
we will do two rotations in one iteration.

SPALY(T, n)
while n.parent != NULL //node is not root
if n.parent == T.root //node is child of root, one rotation 

https://www.codesdope.com/course/data-structures-splay-trees/ 5/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
if n == n.parent.left //left child
RIGHT_ROTATE(T, n.parent)
else //right child
LEFT_ROTATE(T, n.parent)
else //two rotations
...

To perform two rotations, we will first set a variable p as the parent of n and a variable g
as grandparent of n.

SPALY(T, n)
while n.parent != NULL //node is not root
if n.parent == T.root //node is child of root, one rotation
...
else //two rotations
p = n.parent
g = p.parent

https://www.codesdope.com/course/data-structures-splay-trees/ 6/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

Now, we just have to do the rotations.

SPALY(T, n)
while n.parent != NULL //node is not root
...
else //two rotations
...
if n.parent.left == n and p.parent.left == p //both are left children
RIGHT_ROTATE(T, g)
RIGHT_ROTATE(T, p)
else if n.parent.right == n and p.parent.right == p //both are right children
LEFT_ROTATE(T, g)
LEFT_ROTATE(T, p)
else if n.parent.right == n and p.parent.left == p
LEFT_ROTATE(T, p)
RIGHT_ROTATE(T, g)
else
RIGHT_ROTATE(T, p)
LEFT_ROTATE(T, g)

https://www.codesdope.com/course/data-structures-splay-trees/ 7/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
SPLAY(T, n)
while n.parent != NULL //node is not root

if n.parent == T.root //node is child of root, one rotation

if n == n.parent.left //left child
RIGHT_ROTATE(T, n.parent)
else //right child
LEFT_ROTATE(T, n.parent)

else //two rotations

p = n.parent
g = p.parent

if n.parent.left == n and p.parent.left == p //both are left children

RIGHT_ROTATE(T, g)
RIGHT_ROTATE(T, p)
else if n.parent.right == n and p.parent.right == p //both are right c
LEFT_ROTATE(T, g)
LEFT_ROTATE(T, p)
else if n.parent.right == n and p.parent.left == p
LEFT_ROTATE(T, p)
RIGHT_ROTATE(T, g)
else
RIGHT_ROTATE(T, p)
LEFT_ROTATE(T, g)

Searching in a Splay Tree

Searching is just the same as a normal binary search tree, we just splay the node which
was searched to the root

SEARCH(T, n, x)
if x == n.data
SPLAY(T, n)
return n
else if x < n.data
return search(T, n.left, x);
else if x > n.data
return search(T, n.right, x);
else
return NULL

This is the same code that of a binary search tree, we are just splaying the node to root if
it is found - if x == n.data → SPLAY(T, n) .

Insertion in a Splay Tree

We normally insert a node in a splay tree and splay it to the root.

https://www.codesdope.com/course/data-structures-splay-trees/ 8/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

https://www.codesdope.com/course/data-structures-splay-trees/ 9/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
INSERT(T, n)
temp = T.root
y = NULL
while temp != NULL
y = temp
if n.data < temp.data
temp = temp.left
else
temp = temp.right
n.parent = y
if y==NULL
T.root = n
else if n.data < y.data
y.left = n
else
y.right = n

SPLAY(T, n)

Deletion in a Splay Tree

To delete a node in a splay tree, we first splay that node to the root.

After this, we just delete the root which gives us two subtrees.

We find the largest element of the left subtree and splay it to the root.

https://www.codesdope.com/course/data-structures-splay-trees/ 10/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest

Lastly, we attach the right subtree as the right child of the left subtree.

Let's write the code for deletion.

Code for Deletion in Spaly Tree

We will first store the left and right subtrees in different variables.

DELETE(T, n)
left_subtree = new splay_tree
right_subtree = new splay_tree
left_subtree.root = T.root.left
right_subtree = T.root.right
if left_subtree.root != NULL
left_subtree.root.parent = NULL
if right_subtree.root != NULL
right_subtree.root.parent = NULL

Then we will find the maximum of the left subtree and splay it to the root.

if left_subtree.root != NULL
m = MAXIMUM(left_subtree, left_subtree.root)
SPLAY(left_subtree, m)

After that, we will make the right subtree the right child of the new root of the left
subtree.

if left_subtree.root != NULL
...
left_subtree.root.right = right_subtree.root
T.root = left_subtree.root

If there is no left subtree, we will make right subtree the new tree.

if left_subtree.root != NULL
...
else 

https://www.codesdope.com/course/data-structures-splay-trees/ 11/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
T.root = right_subtree.root

if left_subtree.root != NULL
m = MAXIMUM(left_subtree, left_subtree.root)
SPLAY(left_subtree, m)
left_subtree.root.right = right_subtree.root
T.root = left_subtree.root
else
T.root = right_subtree.root

C Python Java

https://www.codesdope.com/course/data-structures-splay-trees/ 12/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
#include <stdio.h>
#include <stdlib.h>

typedef struct node {

int data;
struct node *left;
struct node *right;
struct node *parent;
}node;

typedef struct splay_tree {

struct node *root;
}splay_tree;

node* new_node(int data) {

node *n = malloc(sizeof(node));
n->data = data;
n->parent = NULL;
n->right = NULL;
n->left = NULL;

return n;
}

splay_tree* new_splay_tree() {
splay_tree *t = malloc(sizeof(splay_tree));
t->root = NULL;

return t;
}

node* maximum(splay_tree t, node x) {

while(x->right != NULL)
x = x->right;
return x;
}

void left_rotate(splay_tree t, node x) {

node *y = x->right;
x->right = y->left;
if(y->left != NULL) {
y->left->parent = x;
}
y->parent = x->parent;
if(x->parent == NULL) { //x is root
t->root = y;
}
else if(x == x->parent->left) { //x is left child
x->parent->left = y;
}
else { //x is right child
x->parent->right = y;
}
y->left = x;
x->parent = y;
}

void right_rotate(splay_tree t, node x) {

node *y = x->left;
x->left = y->right;
if(y->right != NULL) {
y->right->parent = x;
}
y->parent = x->parent;
if(x->parent == NULL) { //x is root
t->root = y;
}
else if(x == x->parent->right) { //x is left child
x->parent->right = y;
}
else { //x is right child
x->parent->left = y;
}
y->right = x;
x->parent = y; 
}

https://www.codesdope.com/course/data-structures-splay-trees/ 13/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
void splay(splay_tree *t, node *n) {
while(n->parent != NULL) { //node is not root
if(n->parent == t->root) { //node is child of root, one rotation
if(n == n->parent->left) {
right_rotate(t, n->parent);
}
else {
left_rotate(t, n->parent);
}
}
else {
node *p = n->parent;
node *g = p->parent; //grandparent

if(n->parent->left == n && p->parent->left == p) { //both are left children

right_rotate(t, g);
right_rotate(t, p);
}
else if(n->parent->right == n && p->parent->right == p) { //both are right children
left_rotate(t, g);
left_rotate(t, p);
}
else if(n->parent->right == n && p->parent->left == p) {
left_rotate(t, p);
right_rotate(t, g);
}
else if(n->parent->left == n && p->parent->right == p) {
right_rotate(t, p);
left_rotate(t, g);
}
}
}
}

void insert(splay_tree t, node n) {

node *y = NULL;
node *temp = t->root;
while(temp != NULL) {
y = temp;
if(n->data < temp->data)
temp = temp->left;
else
temp = temp->right;
}
n->parent = y;

if(y == NULL) //newly added node is root

t->root = n;
else if(n->data < y->data)
y->left = n;
else
y->right = n;

splay(t, n);
}

node* search(splay_tree t, node n, int x) {

if(x == n->data) {
splay(t, n);
return n;
}
else if(x < n->data)
return search(t, n->left, x);
else if(x > n->data)
return search(t, n->right, x);
else
return NULL;
}

void delete(splay_tree t, node n) {

splay(t, n);

splay_tree *left_subtree = new_splay_tree();

left_subtree->root = t->root->left;
if(left_subtree->root != NULL)

left_subtree->root->parent = NULL;

https://www.codesdope.com/course/data-structures-splay-trees/ 14/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
splay_tree *right_subtree = new_splay_tree();
right_subtree->root = t->root->right;
if(right_subtree->root != NULL)
right_subtree->root->parent = NULL;

free(n);

if(left_subtree->root != NULL) {
node *m = maximum(left_subtree, left_subtree->root);
splay(left_subtree, m);
left_subtree->root->right = right_subtree->root;
t->root = left_subtree->root;
}
else {
t->root = right_subtree->root;
}
}

void inorder(splay_tree t, node n) {

if(n != NULL) {
inorder(t, n->left);
printf("%d\n", n->data);
inorder(t, n->right);
}
}

int main() {
splay_tree *t = new_splay_tree();

node *a, *b, *c, *d, *e, *f, *g, *h, *i, *j, *k, *l, *m;
a = new_node(10);
b = new_node(20);
c = new_node(30);
d = new_node(100);
e = new_node(90);
f = new_node(40);
g = new_node(50);
h = new_node(60);
i = new_node(70);
j = new_node(80);
k = new_node(150);
l = new_node(110);
m = new_node(120);

insert(t, a);
insert(t, b);
insert(t, c);
insert(t, d);
insert(t, e);
insert(t, f);
insert(t, g);
insert(t, h);
insert(t, i);
insert(t, j);
insert(t, k);
insert(t, l);
insert(t, m);

delete(t, a);
delete(t, m);

inorder(t, t->root);

return 0;
}

 Heard melodies are sweet, but those unheard, are

sweeter 
- John Keats


https://www.codesdope.com/course/data-structures-splay-trees/ 15/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
PREV (/course/data-structures-avl-trees/) (/course/data- NEXT
structures-heap/)

CODESDOPE PRO

It's Simple and Conceptual

with Chance for Internship*

(https://codop.es/pro)

Pro Course Features

 Simple Videos

 Questions to Practice

 Solved Examples

 Internship Chance*

 Certificate of Completion

 Discussion with Experts

Learn for FREE

(https://pro.codesdope.com)

We're Hiring

Campus
Ambassadors

(https://forms.gle/YWUXdKkZ7pbaX8Wr5)

New Questions

The Bradford Exchange

introduction - Other

(/discussion/the-bradford-exchange-
introduction)

Why Capital One Stands Out in

Banking Excellence - Other

(/discussion/why-capital-one-
stands-out-in-banking-excellence) 

https://www.codesdope.com/course/data-structures-splay-trees/ 16/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
(/add_quest
Access Our AIE02 Exam Dumps
- Java
(/discussion/access-our-
aie02-exam-dumps)

Increase Your AICP Exam

Dumps Readiness - Python

(/discussion/increase-your-aicp-
exam-dumps-readiness)

Uncover Our AI-Associate PDF

Dumps - Java

(/discussion/uncover-our-ai-
associate-pdf-dumps)

Achievement AHPP Exam

Dumps with Certs4Exam - Java

(/discussion/achievement-ahpp-
exam-dumps-with-certs4exam)

Access Our AHM-540 Dumps

PDF - Other

(/discussion/access-our-ahm-540-
dumps-pdf)
A s k Yo u r s
(/add_question/)

  
(/discussion/)
 (https://codesdope-


media.nyc3.cdn.digitaloceanspaces.com/prod/media/pdf/ASCII.pd
(/practice/)

  
(https://www.facebook.com/codesdope/)
(https://twitter.com/CodesDope)
(https://www.linkedin.com/company/codesdope)

Dutch National Flag problem

- Sort 0, 1, 2 in an array
(/blog/article/dutch-national-flag-
algorithm/)
memoryview() in Python

memoryview() in Python
(/blog/article/memoryview-in-
python/)
next() in Python

next() in Python
(/blog/article/next-in-python/) 

https://www.codesdope.com/course/data-structures-splay-trees/ 17/18
2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion
P o s t Yo u r s (/add_quest
(/blog/submit-article/)

 (https://www.facebook.com/codesdope)  (https://twitter.com/CodesDope) 
(https://www.pinterest.com/codesdope/) 
(https://www.linkedin.com/company/codesdope)

C AT E G O R I E S

PRO (https://pro.codesdope.com)
ABOUT (/about/)
BLOG (/blog/)
COURSES (/course/)
PRACTICE (/practice/)
DISCUSSION (/discussion/)
TERMS OF USE (/terms-of-use/)
PRIVACY POLICY (/privacy-policy/)
CONTACT US (/contact-us/)
ADVERTISEMENT (/advertise-with-us/)

KEEP IN TOUCH

 [email protected] (mailto:[email protected])

https://www.codesdope.com/course/data-structures-splay-trees/ 18/18

STAT 1520 Notes
No ratings yet
STAT 1520 Notes
61 pages
How To Do Nothing
0% (1)
How To Do Nothing
24 pages
The Enemy Test
38% (8)
The Enemy Test
3 pages
5 The Siege of Skyhold - Mage Errant - John Bierce-2
No ratings yet
5 The Siege of Skyhold - Mage Errant - John Bierce-2
426 pages
IS 875 1987 Part-3 PDF
100% (2)
IS 875 1987 Part-3 PDF
63 pages
Radio Receivers Problems
0% (1)
Radio Receivers Problems
9 pages
Slides21 PDF
No ratings yet
Slides21 PDF
125 pages
Kupchan Method of Partitioning
100% (11)
Kupchan Method of Partitioning
7 pages
Splay Trees: ECE 250 Algorithms and Data Structures
No ratings yet
Splay Trees: ECE 250 Algorithms and Data Structures
64 pages
Persistent Data Structures: Examples
No ratings yet
Persistent Data Structures: Examples
82 pages
Splay Tree Algorithm: Mingda Zhao CSC 252 Algorithms Smith College Fall, 2000
No ratings yet
Splay Tree Algorithm: Mingda Zhao CSC 252 Algorithms Smith College Fall, 2000
57 pages
Splay Tree
100% (1)
Splay Tree
68 pages
Small 08
No ratings yet
Small 08
70 pages
10/27/2023 Splay Trees 1
No ratings yet
10/27/2023 Splay Trees 1
24 pages
Splay Tree
No ratings yet
Splay Tree
40 pages
Splay Trees and B-Trees
No ratings yet
Splay Trees and B-Trees
27 pages
Splay Trees: O (Log N) O (N) O
No ratings yet
Splay Trees: O (Log N) O (N) O
32 pages
Lec 44
No ratings yet
Lec 44
32 pages
Splay Tree: Castaneda, Jonathan S. Piscos, Shiela Mae
No ratings yet
Splay Tree: Castaneda, Jonathan S. Piscos, Shiela Mae
33 pages
Reduced Restructuring in Splay Trees: Evan Huus (Carleton University) April 15, 2014
No ratings yet
Reduced Restructuring in Splay Trees: Evan Huus (Carleton University) April 15, 2014
15 pages
Splay Trees
No ratings yet
Splay Trees
17 pages
S Play Trees
No ratings yet
S Play Trees
18 pages
SP Trees PDF
No ratings yet
SP Trees PDF
22 pages
Splay Tree
No ratings yet
Splay Tree
17 pages
Splay Trees Are Binary Search Trees (BSTS) That
No ratings yet
Splay Trees Are Binary Search Trees (BSTS) That
15 pages
Week 8 Search Tree Algorithms
No ratings yet
Week 8 Search Tree Algorithms
20 pages
CHPT 3 Splay Trees
No ratings yet
CHPT 3 Splay Trees
17 pages
9 Re Task 4 Core 2019 Draft
No ratings yet
9 Re Task 4 Core 2019 Draft
3 pages
Greenstone Digital Library Software
100% (1)
Greenstone Digital Library Software
51 pages
Splay Trees Splay Trees: Invented in 1985 by Daniel Dominic Sleator and Robert Endre Tarjan
No ratings yet
Splay Trees Splay Trees: Invented in 1985 by Daniel Dominic Sleator and Robert Endre Tarjan
76 pages
OJT Case Study
No ratings yet
OJT Case Study
17 pages
CSE 326 Lecture 9: Splay Trees and B-Trees What's On Our Plate Today?
No ratings yet
CSE 326 Lecture 9: Splay Trees and B-Trees What's On Our Plate Today?
11 pages
CHPT 3 Splay Trees
No ratings yet
CHPT 3 Splay Trees
17 pages
Splay Trees
No ratings yet
Splay Trees
4 pages
Today's Outline: CSE 326: Data Structures Topic #7: Don't Sweat It, Splay It!
No ratings yet
Today's Outline: CSE 326: Data Structures Topic #7: Don't Sweat It, Splay It!
6 pages
Lecture 09
No ratings yet
Lecture 09
27 pages
GROMACS Tutorial
No ratings yet
GROMACS Tutorial
22 pages
Scribd Upload A Document Search Documents Explore Sign Up - Log in
No ratings yet
Scribd Upload A Document Search Documents Explore Sign Up - Log in
26 pages
Dsa Assignment (Bikash Ranjan Das)
No ratings yet
Dsa Assignment (Bikash Ranjan Das)
9 pages
ADS & A Unit-3 Study Material
No ratings yet
ADS & A Unit-3 Study Material
27 pages
Nielsen's Companion PDF
No ratings yet
Nielsen's Companion PDF
5 pages
Cepheid Variable Stars Navigation Search
No ratings yet
Cepheid Variable Stars Navigation Search
11 pages
Splay Trees: Sean Lyn April 3, 2008
No ratings yet
Splay Trees: Sean Lyn April 3, 2008
18 pages
CHPT 3 Splay Trees
No ratings yet
CHPT 3 Splay Trees
17 pages
Notes From Wednesday
No ratings yet
Notes From Wednesday
6 pages
Splay Trees-Self Adjusting Trees Bottom-Up Splay Trees: Splay Operation Splay Node
No ratings yet
Splay Trees-Self Adjusting Trees Bottom-Up Splay Trees: Splay Operation Splay Node
3 pages
4.4 Balanced Trees: Symbol Table
No ratings yet
4.4 Balanced Trees: Symbol Table
11 pages
Contoh Proposal
No ratings yet
Contoh Proposal
19 pages
Mechanical Engineering News: For The Power, Petrochemical and Related Industries December, 1997
No ratings yet
Mechanical Engineering News: For The Power, Petrochemical and Related Industries December, 1997
24 pages
Splay Trees Bottom-Up Splay Trees: O (Log N) O (N) O (1) Splay Operation Splay Node
No ratings yet
Splay Trees Bottom-Up Splay Trees: O (Log N) O (N) O (1) Splay Operation Splay Node
8 pages
A Seminar On Electrolytic Production of Metallic Powder: Prepared By: Darshit Fadadu ROLL NO: 938
No ratings yet
A Seminar On Electrolytic Production of Metallic Powder: Prepared By: Darshit Fadadu ROLL NO: 938
13 pages
Ads Unit-3
No ratings yet
Ads Unit-3
20 pages
Splay Trees
No ratings yet
Splay Trees
9 pages
Module 3 Audit Report 15092021
No ratings yet
Module 3 Audit Report 15092021
32 pages
r05312401 Design of Machine Elements
No ratings yet
r05312401 Design of Machine Elements
8 pages
Individual Lesson Plan Leticia Bothi Autosaved
No ratings yet
Individual Lesson Plan Leticia Bothi Autosaved
2 pages
ARTERE User Guide
No ratings yet
ARTERE User Guide
10 pages
A Brief Guide To Writing Social Theory
No ratings yet
A Brief Guide To Writing Social Theory
5 pages
CSCE 2211 - 8 - Splay Trees
No ratings yet
CSCE 2211 - 8 - Splay Trees
21 pages
Introduction To Splay Tree Data Structure
No ratings yet
Introduction To Splay Tree Data Structure
12 pages
The Quest For The Fulfillment of Destiny:A Study On Santiago in Paulo Coelho's "Alchemist."
No ratings yet
The Quest For The Fulfillment of Destiny:A Study On Santiago in Paulo Coelho's "Alchemist."
4 pages
Management Accounting: Information That Creates Value
No ratings yet
Management Accounting: Information That Creates Value
27 pages
Cp4151-Advanced Data Structures and Algorithms: Unit 2
No ratings yet
Cp4151-Advanced Data Structures and Algorithms: Unit 2
100 pages
39 - Data Structure and Algorithms - Splay Trees
No ratings yet
39 - Data Structure and Algorithms - Splay Trees
14 pages
Ch-3: Search Trees
No ratings yet
Ch-3: Search Trees
12 pages
Thesis Materials and Methods Example
100% (3)
Thesis Materials and Methods Example
7 pages
Ankush Gawri: Personal Statement
No ratings yet
Ankush Gawri: Personal Statement
4 pages
0-Course Outline CSE 105
No ratings yet
0-Course Outline CSE 105
4 pages
Lesson Plan Sheet: LAM - KUR - 02 - 01 Sma Lazuardi Gis Subject: Chemistry 1 Semester Academic Year 2010 - 2011
No ratings yet
Lesson Plan Sheet: LAM - KUR - 02 - 01 Sma Lazuardi Gis Subject: Chemistry 1 Semester Academic Year 2010 - 2011
4 pages
Splaytree and Heaps Bianry Ttree
No ratings yet
Splaytree and Heaps Bianry Ttree
19 pages
CV - Bors Alin Cristian
No ratings yet
CV - Bors Alin Cristian
2 pages
Splaytrees
No ratings yet
Splaytrees
11 pages
Lecture08 Splay Trees
No ratings yet
Lecture08 Splay Trees
13 pages
Splay Tree in Data Structure - Simplerize
No ratings yet
Splay Tree in Data Structure - Simplerize
20 pages
Splay Tree
No ratings yet
Splay Tree
12 pages
Splay Tree
No ratings yet
Splay Tree
17 pages
Data Structure Avl and Splay Trees
No ratings yet
Data Structure Avl and Splay Trees
10 pages
Splay Trees PPT
No ratings yet
Splay Trees PPT
27 pages
Chapter12 Part1 TD Splay
No ratings yet
Chapter12 Part1 TD Splay
18 pages
AP Psych Unit 10 Personality Defense Mechanisms in Movie and TV Project
No ratings yet
AP Psych Unit 10 Personality Defense Mechanisms in Movie and TV Project
1 page
Document
No ratings yet
Document
14 pages
Splay Trees & B-Trees
No ratings yet
Splay Trees & B-Trees
27 pages
Wa0002.
No ratings yet
Wa0002.
35 pages
Ads Unit - 5
No ratings yet
Ads Unit - 5
16 pages
Psychology Viva Cheat Sheet
No ratings yet
Psychology Viva Cheat Sheet
3 pages

Splay Trees - Splaying, Insertion and Deletion

Uploaded by

Splay Trees - Splaying, Insertion and Deletion

Uploaded by

2/14/24, 11:10 AM Splay Trees : Splaying, Insertion and Deletion

Linked Lists (/course/data-structures-linked-lists/)

Doubly Linked Lists (/course/data-structures-doubly-linked-lists/)

Circular Linked Lists (/course/data-structures-circular-linked-lists/)

Binary Trees (/course/data-structures-binary-trees/)

Binary Search Trees (/course/data-structures-binary-search-trees/)

Red-Black Trees (/course/data-structures-red-black-trees/)

Red-Black Trees 2 (/course/data-structures-red-black-trees-insertion/)

Red-Black Trees 3 (/course/data-structures-red-black-trees-deletion/)

AVL Trees (/course/data-structures-avl-trees/)

Splay Trees (/course/data-structures-splay-trees/)

Priority Queues (/course/data-structures-priority-queues/)

Let's learn how these trees adjust nodes on accessing them.

"Splaying" is a process in which a node is transferred to the root by performing suitable

Zig-Zig and Zig-Zag

Let's take a look at some examples.

Let's write a code to splay a node to the root.

Code for Splaying

Now, we just have to do the rotations.

if n.parent == T.root //node is child of root, one rotation

else //two rotations

if n.parent.left == n and p.parent.left == p //both are left children

Searching in a Splay Tree

Insertion in a Splay Tree

We normally insert a node in a splay tree and splay it to the root.

Deletion in a Splay Tree

Let's write the code for deletion.

Code for Deletion in Spaly Tree

typedef struct node {

typedef struct splay_tree {

node* new_node(int data) {

node* maximum(splay_tree *t, node *x) {

void left_rotate(splay_tree *t, node *x) {

void right_rotate(splay_tree *t, node *x) {

if(n->parent->left == n && p->parent->left == p) { //both are left children

void insert(splay_tree *t, node *n) {

if(y == NULL) //newly added node is root

node* search(splay_tree *t, node *n, int x) {

void delete(splay_tree *t, node *n) {

splay_tree *left_subtree = new_splay_tree();

void inorder(splay_tree *t, node *n) {

 Heard melodies are sweet, but those unheard, are

It's Simple and Conceptual

with Chance for Internship*

Pro Course Features

 Discussion with Experts

Learn for FREE

The Bradford Exchange

Why Capital One Stands Out in

Increase Your AICP Exam

Uncover Our AI-Associate PDF

Achievement AHPP Exam

Access Our AHM-540 Dumps

Dutch National Flag problem

© | www.codesdope.com (/) | All rights reserved.

You might also like

node* maximum(splay_tree t, node x) {

void left_rotate(splay_tree t, node x) {

void right_rotate(splay_tree t, node x) {

void insert(splay_tree t, node n) {

node* search(splay_tree t, node n, int x) {

void delete(splay_tree t, node n) {

void inorder(splay_tree t, node n) {