首先，要知道B tree的主要元素是所謂的資料節點(node) ，每個資料節點內含有一些資料，以及指向其他資料節點的指標(pointer)。資料節點之間以枝幹相連，尾端就是枝葉(leaf) ，假設開始插入的資料順序為 : 1，2，3，4，5，6。以下就依照B tree的規則來種樹。-First of all, we know the main elements of B tree is the so-called information node (node), each data node contains some information, as well as other data point to the node indicator (pointer). Information between the nodes connected to the branches, that is the end of branches and leaves (leaf), the assumption that the information began to insert the following order: 1,2,3,4,5,6. On the B tree in accordance with the following rules to plant trees.