title: "order and degree of Btree"
body: <p>What is relation between "order" and "degree" of B tree?</p>
  
  <p>Different books used different convention.
  If order =m then maximum key possible in a non root node is (m-1) (classic Data Structure ,Debasis Samanta,p-380)</p>
  
  <p>If degree=t maximum node possible in a non root node is (2t-1)(Introduction to algorithm,by Cormen....,p-489)
  If I merge this two then I can get
   m-1=2t-1=>m=2t (My idea,though it seems to be incorrect)
  can anyone explain......Thanks.</p>
  
  <p><a href="https://cs.stackexchange.com/questions/6799/b-tree-is-degree-and-order-both-are-the-same-thing-related-to-a-b-tree">https://cs.stackexchange.com/questions/6799/b-tree-is-degree-and-order-both-are-the-same-thing-related-to-a-b-tree</a> 
  I have already seen this but this is not clearing my confusion.</p>