复制BTree_Search(node,索数据 key) { if(node == null) returnnull; foreach(node.key) { if(node.key[i] == key) return node.data[i]; if(node.key[i] > key) return BTree_Search(point[i]->node); } return BTree_Search(point[i+1]->node); } data = BTree_Search(root, my_key); 1.2.3.4.5.6.7.8.9.10.11. |
喜欢
讨厌