Question
Define b-tree of order m?
Answers
A B-tree of order M is a tree that is not binary with the following structural properties:

The root is either a leaf or has between 2 and M children.
All non-leaf nodes (except the root) have between [M/2] and M children.
All leaves are at the same depth.   Your Comment




  • Contributors: *,


Search
Can you Answer!!
  • Q Explain about the different types of partitioning in Hive?
  • Q What is Duplex in WCF? Explain also Message Exchange Pattern?
  • Q What is 2-phase commit?
  • Q What is the difference between strcpy() & strncpy() functions in C?
  • Q Classify lipids and describe Sudan Black B method.
  • Q What is the main functionality of the remote reference layer ?
  • Q A man can do a piece of work in 9 days, a woman can do 3/4 as much work as a man in one day and a boy in twice the time that a man takes. How many days wil 2 men, 3 women and 5 boys together take to do the work?
  • Q How many businesses open and close each year?
  • Q What is the major basic feature of the Indian Constitution?
  • Q A Tintinnabulum is a: Flower; Compass; Bell; or Cave?
  • Q What is a lie? How do I know what you just said isn't a lie?