樣板 B 樹 ( B - tree )
規則 :
(1) 每個節點內元素個數在 [MIN,2*MIN] 之間, 但根節點元素個數為 [1,2*MIN]
(2) 節點內元素由小排到大, 元素不重複
(3) 每個節點內的指標個數為元素個數加一
(4) 第 i 個指標所指向的子節點內的所有元素值皆小於父節點的第 i 個元素
(5) B 樹內的所有末端節點深度一樣
10 C++ Books:
*C++ Timesaving Techniques For Dummies (2005)
*C-C++ Programmer s Reference, 3rd Edition (2003)
*Creating Games In C++ - A Step By Step Guide (2006)
*Cryptography In C And C++ (2001)
*Effective C++, 3rd Edition (2005)
*Exceptional C++ - 47 Engineering Puzzles, *Programming Problems, And Solutions (1999)
*Exceptional C++ Style - 40 New Engineering Puzzles, Programming Problems, And Solutions (2004)
*How Not To Program In C++ (2003)
*Ivor Horton s Beginning Visual C++ 2005 (2006)
*Learn To Program With C++ (2003)
