{"id":199644,"date":"2025-05-06T08:11:45","date_gmt":"2025-05-06T00:11:45","guid":{"rendered":"https:\/\/server.hk\/cnblog\/199644\/"},"modified":"2025-05-06T08:11:45","modified_gmt":"2025-05-06T00:11:45","slug":"%e4%bd%bf%e7%94%a8python%e7%bc%96%e5%86%99%e7%9a%84b%e6%a0%91%e6%8f%92%e5%85%a5%e5%8a%9f%e8%83%bd%e7%9a%84%e4%bb%a3%e7%a0%81","status":"publish","type":"post","link":"https:\/\/server.hk\/cnblog\/199644\/","title":{"rendered":"\u4f7f\u7528Python\u7f16\u5199\u7684B+\u6811\u63d2\u5165\u529f\u80fd\u7684\u4ee3\u7801"},"content":{"rendered":"<p><b><\/b> <\/p>\n<h1>\u4f7f\u7528Python\u7f16\u5199\u7684B+\u6811\u63d2\u5165\u529f\u80fd\u7684\u4ee3\u7801<\/h1>\n<p>\u4eca\u5929\u4e3b\u673a\u5b9d\u8d1d\u7ed9\u5927\u5bb6\u5e26\u6765\u4e86\uff0c\u5176\u4e2d\u6d89\u53ca\u5230\u7684\u77e5\u8bc6\u70b9\u5305\u62ec\u7b49\u7b49\uff0c\u65e0\u8bba\u4f60\u662f\u5c0f\u767d\u8fd8\u662f\u8001\u624b\uff0c\u90fd\u9002\u5408\u770b\u4e00\u770b\u54e6~\u6709\u597d\u7684\u5efa\u8bae\u4e5f\u6b22\u8fce\u5927\u5bb6\u5728\u8bc4\u8bba\u7559\u8a00\uff0c\u82e5\u662f\u770b\u5b8c\u6709\u6240\u6536\u83b7\uff0c\u4e5f\u5e0c\u671b\u5927\u5bb6\u80fd\u591a\u591a\u70b9\u8d5e\u652f\u6301\u5440\uff01\u4e00\u8d77\u52a0\u6cb9\u5b66\u4e60~<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/www.17golang.com\/uploads\/20240128\/170644428165b645f9dbd9a.jpg\" class=\"aligncenter\"><\/p>\n<p>B+\u6811\u63d2\u5165\u64cd\u4f5c\u9700\u8981\u8003\u8651\u8282\u70b9\u548c\u5e73\u8861\uff0c\u5982\u679c\u662f\u7a7a\u6811\uff0c\u6309\u9012\u589e\u987a\u5e8f\u5c06key\u63d2\u5165\u53f6\u5b50\u8282\u70b9\uff1b\u5982\u679c\u4e0d\u662f\u7a7a\u6811\uff0c\u9700\u8981\u533a\u5206\u7d22\u5f15\u8282\u70b9\u548c\u53f6\u5b50\u8282\u70b9\uff0c\u4e0d\u6ee1\u8db3\u6761\u4ef6\u65f6\u8fd8\u8981\u5bf9\u8282\u70b9\u8fdb\u884c\u5206\u89e3\u3002<\/p>\n<h2>Python\u5b9e\u73b0B+\u6811\u63d2\u5165\u64cd\u4f5c<\/h2>\n<pre>import math\r\n# \u521b\u5efa\u8282\u70b9\r\nclass Node:\r\n    def __init__(self, order):\r\n        self.order = order\r\n        self.values = []\r\n        self.keys = []\r\n        self.nextKey = None\r\n        self.parent = None\r\n        self.check_leaf = False\r\n\r\n    def insert_at_leaf(self, leaf, value, key):\r\n        if (self.values):\r\n            temp1 = self.values\r\n            for i in range(len(temp1)):\r\n                if (value == temp1[i]):\r\n                    self.keys[i].append(key)\r\n                    break\r\n                elif (value &lt; temp1[i]):\r\n                    self.values = self.values[:i] + [value] + self.values[i:]\r\n                    self.keys = self.keys[:i] + [[key]] + self.keys[i:]\r\n                    break\r\n                elif (i + 1 == len(temp1)):\r\n                    self.values.append(value)\r\n                    self.keys.append([key])\r\n                    break\r\n        else:\r\n            self.values = [value]\r\n            self.keys = [[key]]\r\n\r\n\r\n# B+\u6811\r\nclass BplusTree:\r\n    def __init__(self, order):\r\n        self.root = Node(order)\r\n        self.root.check_leaf = True\r\n\r\n    # \u63d2\u5165\u64cd\u4f5c\r\n    def insert(self, value, key):\r\n        value = str(value)\r\n        old_node = self.search(value)\r\n        old_node.insert_at_leaf(old_node, value, key)\r\n\r\n        if (len(old_node.values) == old_node.order):\r\n            node1 = Node(old_node.order)\r\n            node1.check_leaf = True\r\n            node1.parent = old_node.parent\r\n            mid = int(math.ceil(old_node.order \/ 2)) - 1\r\n            node1.values = old_node.values[mid + 1:]\r\n            node1.keys = old_node.keys[mid + 1:]\r\n            node1.nextKey = old_node.nextKey\r\n            old_node.values = old_node.values[:mid + 1]\r\n            old_node.keys = old_node.keys[:mid + 1]\r\n            old_node.nextKey = node1\r\n            self.insert_in_parent(old_node, node1.values[0], node1)\r\n\r\n    # \u641c\u7d22\u64cd\u4f5c\r\n    def search(self, value):\r\n        current_node = self.root\r\n        while(current_node.check_leaf == False):\r\n            temp2 = current_node.values\r\n            for i in range(len(temp2)):\r\n                if (value == temp2[i]):\r\n                    current_node = current_node.keys[i + 1]\r\n                    break\r\n                elif (value &lt; temp2[i]):\r\n                    current_node = current_node.keys[i]\r\n                    break\r\n                elif (i + 1 == len(current_node.values)):\r\n                    current_node = current_node.keys[i + 1]\r\n                    break\r\n        return current_node\r\n\r\n    # \u641c\u7d22\u8282\u70b9\r\n    def find(self, value, key):\r\n        l = self.search(value)\r\n        for i, item in enumerate(l.values):\r\n            if item == value:\r\n                if key in l.keys[i]:\r\n                    return True\r\n                else:\r\n                    return False\r\n        return False\r\n\r\n    # \u5728\u7236\u7ea7\u63d2\u5165\r\n    def insert_in_parent(self, n, value, ndash):\r\n        if (self.root == n):\r\n            rootNode = Node(n.order)\r\n            rootNode.values = [value]\r\n            rootNode.keys = [n, ndash]\r\n            self.root = rootNode\r\n            n.parent = rootNode\r\n            ndash.parent = rootNode\r\n            return\r\n\r\n        parentNode = n.parent\r\n        temp3 = parentNode.keys\r\n        for i in range(len(temp3)):\r\n            if (temp3[i] == n):\r\n                parentNode.values = parentNode.values[:i] + \\\r\n                    [value] + parentNode.values[i:]\r\n                parentNode.keys = parentNode.keys[:i +\r\n                                                  1] + [ndash] + parentNode.keys[i + 1:]\r\n                if (len(parentNode.keys) &gt; parentNode.order):\r\n                    parentdash = Node(parentNode.order)\r\n                    parentdash.parent = parentNode.parent\r\n                    mid = int(math.ceil(parentNode.order \/ 2)) - 1\r\n                    parentdash.values = parentNode.values[mid + 1:]\r\n                    parentdash.keys = parentNode.keys[mid + 1:]\r\n                    value_ = parentNode.values[mid]\r\n                    if (mid == 0):\r\n                        parentNode.values = parentNode.values[:mid + 1]\r\n                    else:\r\n                        parentNode.values = parentNode.values[:mid]\r\n                    parentNode.keys = parentNode.keys[:mid + 1]\r\n                    for j in parentNode.keys:\r\n                        j.parent = parentNode\r\n                    for j in parentdash.keys:\r\n                        j.parent = parentdash\r\n                    self.insert_in_parent(parentNode, value_, parentdash)\r\n\r\n# \u8f93\u51fa\u6811\r\ndef printTree(tree):\r\n    lst = [tree.root]\r\n    level = [0]\r\n    leaf = None\r\n    flag = 0\r\n    lev_leaf = 0\r\n\r\n    node1 = Node(str(level[0]) + str(tree.root.values))\r\n\r\n    while (len(lst) != 0):\r\n        x = lst.pop(0)\r\n        lev = level.pop(0)\r\n        if (x.check_leaf == False):\r\n            for i, item in enumerate(x.keys):\r\n                print(item.values)\r\n        else:\r\n            for i, item in enumerate(x.keys):\r\n                print(item.values)\r\n            if (flag == 0):\r\n                lev_leaf = lev\r\n                leaf = x\r\n                flag = 1\r\n\r\nrecord_len = 3\r\nbplustree = BplusTree(record_len)\r\nbplustree.insert('5', '33')\r\nbplustree.insert('15', '21')\r\nbplustree.insert('25', '31')\r\nbplustree.insert('35', '41')\r\nbplustree.insert('45', '10')\r\n\r\nprintTree(bplustree)\r\n\r\nif(bplustree.find('5', '34')):\r\n    print(\"Found\")\r\nelse:\r\n    print(\"Not found\")<\/pre>\n<p>\u597d\u4e86\uff0c\u672c\u6587\u5230\u6b64\u7ed3\u675f\uff0c\u5e26\u5927\u5bb6\u4e86\u89e3\u4e86\u300a\u4f7f\u7528Python\u7f16\u5199\u7684B+\u6811\u63d2\u5165\u529f\u80fd\u7684\u4ee3\u7801\u300b\uff0c\u5e0c\u671b\u672c\u6587\u5bf9\u4f60\u6709\u6240\u5e2e\u52a9\uff01\u5173\u6ce8\u4e3b\u673a\u5b9d\u8d1d\u516c\u4f17\u53f7\uff0c\u7ed9\u5927\u5bb6\u5206\u4eab\u66f4\u591a\u6570\u636e\u5e93\u77e5\u8bc6\uff01<\/p>\n<p> \u7248\u672c\u58f0\u660e \u672c\u6587\u8f6c\u8f7d\u4e8e\uff1a\u7f51\u6613\u4f0f\u7fb2 \u5982\u6709\u4fb5\u72af\uff0c\u8bf7\u8054\u7cfb \u5220\u9664 <\/p>\n<dl>\n<dt>\n <\/dt>\n<\/dl>\n","protected":false},"excerpt":{"rendered":"<p>\u4f7f\u7528Python\u7f16\u5199\u7684B+\u6811\u63d2\u5165&#46;&#46;&#46;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[101],"tags":[],"class_list":["post-199644","post","type-post","status-publish","format-standard","hentry","category-database"],"_links":{"self":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/199644","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/comments?post=199644"}],"version-history":[{"count":0,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/posts\/199644\/revisions"}],"wp:attachment":[{"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/media?parent=199644"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/categories?post=199644"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/server.hk\/cnblog\/wp-json\/wp\/v2\/tags?post=199644"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}