TREAPS

-

 treaps= trees + heaps

INRODUCTION

1.    every node in treap data structure has two main entities  first is key which is component for tree               property and second is priority which components for min heap property.

2.    if node1 has higher property than node2 then node2 will lie below the node 1 & if key of node1 is less        than key of node2 then node1 will lie in left side of tree and node2 will lie on right side of tree.

OPERATIONS

1.    Search => time for successfull search is proportional to depth of node & time of unsuccessfull                                 search    is proportional to depth of node.

2.    Insertion=> First we will do normal search tree insertion, then after that to make it min heap we                               will   rotate the  nodes such that priority of that node is higher than its parent, and                                   rotate it such   a way that its depth decreases by one and depth of parent increases                                   byone.





3.    Delete=> rotate the node to be deleted with low priority node until the node to be deleted is leaf                           node,and chop it after it becomes leaf node.


Comments

Post a Comment

Popular posts from this blog

LOWEST COMMON ANCESTOR IN BST

-
 PROBLEM => FIND THE LOWEST COMMON ANCESTOR OF TWO NODES (a & b) IN BINARY                                        SEARCH TREE STEPS =>  1.Find whether these two nodes are present in bst.If not found then return NULL. 2.If both nodes are found then there are 4 possibilites =>                    1.root == a || root == b => return root                    2.a is found in left subtree and b is found in right subtree => return NULL from that subtree                                  where we cant find both a & b                    3.if a and b are found in left/right subtree return root node * lca...
Read more

3 MAPPING TECHNIQUES

-
Image
 WHAT IS MAPPING?      We need to bring data from the main memory to the cache for reducing the access time for the CPU as the cache is closer to the CPU than the main memory.  ASSOCIATIVE MAPPING     Data from main memory are placed randomly in cache.Let us say we have 16 bit memory address then out of that we have 12 bit tag bits & 4 bit word bits .That is cache will have total 2^12 blocks and each block will have 2^4 data words.if get 1111111111111111 then tag bits is 111111111111 & word bits is 1111,that is we will look for block with tage of 111111111111 and in that block we will search for 16th word block.refer the figure =>  benefits of associative mapping are like  No thrashing as it happens in direct mapping  DIRECT MAPPING     Same like above , if we use 16 bit addressing then tag bits have 5 bits,block bits of 7bits & word bits have 4 bits .Word bit identifies the column number,block bit identifies the...
Read more

VIRTUAL MEMORY

-
Image
  Basic Idea Of Virtual Memory     Let us say we have a game of 50GB and RAM of 8 GB then by logic we will think that 50GB is greater than 8GB so the game can't fit in RAM so the game cant work. This is not the computers and world work pal...     Of 50GB let us say we require only 2 GB of data of RAM for making a game run and RAM is   8GB, yes we will put those data in RAM that is in use and others in physical memory (disk ) that are not in use right now.     The above process is done by the concept of virtual memory, it will show that it is doing hard work (running  50GB in 8GB space) but actually, it is doing smart work (running 2GB in 8GB).     Take a look at the following diagram =>       1. Processor issues for a virtual address asking for a physical address 2. Memory Management Unit converts the virtual address into a physical address using some internal methods. 3. You get data from that physical a...
Read more