1.

What Do You Mean By 2-3 Tree?

Answer»

A B-tree of order 3 is CALLED 2-3 tree. A B-tree of order 3 is a tree that is not binary with the following STRUCTURAL PROPERTIES:

  • The ROOT is either a leaf or has between 2 and 3 children.
  • All non-leaf nodes (EXCEPT the root) have between 2 and 3 children.
  • All leaves are at the same depth.

A B-tree of order 3 is called 2-3 tree. A B-tree of order 3 is a tree that is not binary with the following structural properties:



Discussion

No Comment Found