View Dialogue

Enhance Article

Save Article

Like Article

View Dialogue

Enhance Article

Save Article

Like Article

AVL Bushes:

AVL tree is a self-balancing binary search tree during which every node preserve an additional issue which is named steadiness issue whose worth is both -1, 0 or 1.

B-Tree:

A B-tree is a self – balancing tree knowledge construction that retains knowledge sorted and permits searches, insertions, and deletions in O(log N)  time.

Distinction between AVL Tree and B-Tree:

S.No.  

                                             AVL Bushes                                                  

                                                           B-Tree                                                         

1

It’s a self-balancing binary search tree It’s a multi-way tree(N – ary tree).

2

Each node incorporates at most 2 baby nodes On this tree, nodes can have a number of baby nodes

3

It has a steadiness issue whose worth is both -1, 0, or 1.

Stability issue = (top of left subtree)-(top of proper subtree)

or

Stability issue = (top of proper subtree)-(top of left subtree)

B-Tree is outlined by the time period minimal diploma ‘t‘. The worth of ‘t‘ relies upon upon disk block measurement.
Each node besides the foundation should include not less than t-1 keys. The foundation might include a minimal of 1 key.

4

AVL tree has a top of log(N) (The place N is the variety of nodes). B-tree has a top of log(M*N) (The place ‘M’ is the order of tree and N is the variety of nodes).

By admin

Leave a Reply

Your email address will not be published.