title: b-tree pseudocode confusion
body: <p>I am trying to implement b-tree from pseudocode, here is some explanation about b-tree:</p>
  
  <p><a href="http://cs.utsa.edu/~dj/ut/utsa/cs3343/lecture17.html" rel="nofollow">http://cs.utsa.edu/~dj/ut/utsa/cs3343/lecture17.html</a>
  <a href="http://www.di.ufpb.br/lucidio/Btrees.pdf" rel="nofollow">http://www.di.ufpb.br/lucidio/Btrees.pdf</a>
  <a href="http://homepages.ius.edu/RWISMAN/C455/html/notes/Chapter18/BT-Basics.htm" rel="nofollow">http://homepages.ius.edu/RWISMAN/C455/html/notes/Chapter18/BT-Basics.htm</a></p>
  
  <p>So i want to implement the code in python, but only one thing is not clear for me, what is the purpose of "t" in this code:</p>
  
  <pre><code>def bTreeInsert(T, k):              #k is the key
      r = T.root                      #r - root node
      if r.n == 2*t - 1:              #t = ???
          s = AlocateNode()
          T.root = s
          s.leaf = False
          s.n = 0
          s.c[1] = r                  
          bTreeSplitChildren(s, 1)
          bTreeInsertNonfull(s, k)
      else:
          bTreeInsertNonfull(r, l)
  </code></pre>
  
  <p>Any ideas?</p>