Institute Academy

                                   B+ Tree What is B+ Tree ? B+ Tree : A B+ tree is an N-ary tree with a variable but often earge number of children per node . A B+ tree Consist Three Thing                                                1) Root                                               2) Internal node                                             ...

                                     B-tree What is B-tree ?  B-tree : A b-tree is a self-balancing Tree data Structure  . it maintains sorted data and allows searches , Sequential access , insertion and deletion in O( log n ) Time . Properties Of B-tree : A B-tree of order M is a tree which satisfied the following properties                          1) Every Node At most M children                         2) Every non-leaf node has at least ⌈ M /2⌉Child nodes .             ...

                                Splay Tree What is Splay Tree ?  Splay Tree : A Splay Tree is a Self-Adjusting Binary search Tree with the additional property that recently accessed element are quick to access again . Time Complexity Of  Splay Tree   : average case = O( log n ) and worst case = O(n) .   Space Complexity  Of  Splay Tree    : both Cases Average and worst cases show O(n) . Advantage  Of  Splay Tree     :                            1) Comparable performance : Average case performance is as efficient ( O)log n ) ) .             ...

                          Red-Black Tree What is Red-Black Tree ? Red Black Tree : A Red Black Tree is a kind of Self-Balancing binary search Tree in Computer Science .  Properties :                             1)  Root node is always Black if Root Node is red then you have to change into black.                           2) each node either red or black .                           3) All leaves ( Nil ) are black .                 ...

                  Run time Environment Storage Allocation Strategies : There are three type Storage Allocation Strategies        i) Static Allocation        ii) Stack Allocation         iii) Heap Allocation 1) Static Allocation :  i) Allocation is done at Compile Time                               ii) Binding Do not Change at run time                               iii) one activation record per procedure Disadvantage : i) Recursion is not supported                         ii) size of data object ...