retagged by
891 views
2 votes
2 votes

A B-tree of order m is a tree which satisfies the following properties:

  1. Every node has at most m children.
  2. Every  node (except root) has at least ⌈m/2⌉ children  

maximium no of internal nodes an order 4 B tree can have with 20 keys.

retagged by

1 Answer

Related questions

4 votes
4 votes
3 answers
4
smartmeet asked Feb 7, 2017
782 views
Given TMs and L = {x/Every halts on input x } which of the following is true about L?(A) L is recursively enumerable but not recursive(B) L is Recursive but not Context...