Advanced data structures - splay trees, Data Structure & Algorithms

This is a unit of which targeted on the emerging data structures. Red- Black trees, Splay trees, AA-trees & Treaps are introduced. The learner must explore the possibilities of applying these concepts in real life.

Splay trees are binary search trees that are self adjusting. Basically, self adjusts means that whenever a splay tree is accessed for insertion or deletion of a node, then that node pushes all the remaining nodes to become root. Thus, we can conclude that any node that is accessed frequently will be at the top levels of the Splay tree.

A Red-Black tree is a type of binary search tree in which each node is either red or black. In spite of that, the root is always black. If a node is red, then its children must be black. For every node, all the paths from a node to its leaves contain the identical number of black nodes.

AA-trees are described in terms of level of each node rather than storing a color bit with each node. AA-trees have also been designed in such a way that it must satisfy certain conditions regarding its new property that means level.

The priorities of nodes of a Treap must satisfy the heap order. Therefore, the priority of any node should be as large as it's parent's. Treap is the simplest of all the trees.

Posted Date: 4/11/2013 6:06:14 AM | Location : United States

Related Discussions:- Advanced data structures - splay trees, Assignment Help, Ask Question on Advanced data structures - splay trees, Get Answer, Expert's Help, Advanced data structures - splay trees Discussions

Write discussion on Advanced data structures - splay trees
Your posts are moderated
Related Questions
Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

In this unit, the following four advanced data structures have been practically emphasized. These may be considered as alternative to a height balanced tree, i.e., AVL tree.

A binary tree is a special tree where each non-leaf node can have atmost two child nodes. Most important types of trees which are used to model yes/no, on/off, higher/lower, i.e.,

Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

What is an unreachable code assertion An unreachable code assertion can be placed at the default case; if it's every executed, then program is in an erroneous state. A loop in

What is Access Restrictions Structured containers with access restrictions only allow clients to add, remove and examine elements at certain locations in their structure. For

Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

Q. Write an algorithm that counts number of nodes in a linked list.                                       A n s . Algo rithm to Count No. of Nodes in Linked List C

write an algorithm for the gpa of six students