{"id":315357,"date":"2024-05-20T23:58:22","date_gmt":"2024-05-20T15:58:22","guid":{"rendered":"https:\/\/docs.pingcode.com\/ask\/ask-ask\/315357.html"},"modified":"2024-05-20T23:58:44","modified_gmt":"2024-05-20T15:58:44","slug":"python-%e5%ae%9e%e7%8e%b0%e4%ba%8c%e5%8f%89%e6%90%9c%e7%b4%a2%e6%a0%91%e7%9a%84%e6%96%b9%e6%b3%95%e6%9c%89%e5%93%aa%e4%ba%9b","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/315357.html","title":{"rendered":"python \u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u65b9\u6cd5\u6709\u54ea\u4e9b"},"content":{"rendered":"

\"python<\/p>\n

\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u4e00\u79cd\u7279\u6b8a\u7684\u4e8c\u53c9\u6811\uff0c\u5b83\u5177\u6709\u4ee5\u4e0b\u6027\u8d28\uff1a\u6bcf\u4e2a\u8282\u70b9\u7684\u5de6\u5b50\u6811\u53ea\u5305\u542b\u5c0f\u4e8e\u5f53\u524d\u8282\u70b9\u7684\u6570\u3001\u6bcf\u4e2a\u8282\u70b9\u7684\u53f3\u5b50\u6811\u53ea\u5305\u542b\u5927\u4e8e\u5f53\u524d\u8282\u70b9\u7684\u6570\u3001\u5e76\u4e14\u6bcf\u4e2a\u5b50\u6811\u4e5f\u90fd\u662f\u4e8c\u53c9\u641c\u7d22\u6811<\/strong>\u3002\u5728Python\u4e2d\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u65b9\u6cd5\u4e3b\u8981\u5305\u62ec\uff1a\u5b9a\u4e49\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6570\u636e\u7ed3\u6784\u3001\u5b9e\u73b0\u63d2\u5165\u8282\u70b9\u7684\u529f\u80fd\u3001\u5b9e\u73b0\u641c\u7d22\u8282\u70b9\u7684\u529f\u80fd\u3001\u5b9e\u73b0\u5220\u9664\u8282\u70b9\u7684\u529f\u80fd\u4ee5\u53ca\u989d\u5916\u7684\u4e00\u4e9b\u64cd\u4f5c\u5982\u904d\u5386\u8282\u70b9\u7b49\u3002<\/p>\n<\/p>\n

\u4e3a\u4e86\u8be6\u7ec6\u8bf4\u660e\u5982\u4f55\u5728Python\u4e2d\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u548c\u5b83\u4eec\u7684\u4e3b\u8981\u529f\u80fd\uff0c\u6211\u4eec\u4f1a\u9010\u6b65\u5206\u6790\u6bcf\u4e2a\u90e8\u5206\u7684\u5b9e\u73b0\u65b9\u6cd5\u3002<\/p>\n<\/p>\n

\u4e00\u3001\u5b9a\u4e49\u4e8c\u53c9\u641c\u7d22\u6811\u7ed3\u6784<\/h3>\n<\/p>\n

\u9996\u5148\uff0c\u6211\u4eec\u9700\u8981\u5b9a\u4e49\u6811\u7684\u8282\u70b9\u548c\u4e8c\u53c9\u641c\u7d22\u6811\u672c\u8eab\u3002\u8282\u70b9\u901a\u5e38\u5305\u542b\u5b83\u7684\u503c\u548c\u6307\u5411\u5de6\u5b50\u8282\u70b9\u548c\u53f3\u5b50\u8282\u70b9\u7684\u5f15\u7528\u3002<\/p>\n<\/p>\n

class TreeNode:<\/p>\n
    def __init__(self, value):<\/p>\n
        self.value = value<\/p>\n
        self.left = None<\/p>\n
        self.right = None<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u63a5\u7740\uff0c\u6211\u4eec\u5b9a\u4e49\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7ed3\u6784\uff0c\u5b83\u5305\u542b\u4e00\u4e2a\u6307\u5411\u6839\u8282\u70b9\u7684\u5f15\u7528\uff1a<\/p>\n<\/p>\n
class BinarySearchTree:<\/p>\n
    def __init__(self):<\/p>\n
        self.root = None<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e8c\u3001\u5b9e\u73b0\u63d2\u5165\u8282\u70b9\u529f\u80fd<\/h3>\n<\/p>\n
\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u5173\u952e\u64cd\u4f5c\u4e4b\u4e00\u662f\u80fd\u591f\u63d2\u5165\u65b0\u7684\u8282\u70b9\uff0c\u4fdd\u6301\u6811\u7684\u6709\u5e8f\u6027\u8d28\u3002<\/p>\n<\/p>\n
class BinarySearchTree(BinarySearchTree):<\/p>\n
    def insert(self, value):<\/p>\n
        if not self.root:<\/p>\n
            self.root = TreeNode(value)<\/p>\n
        else:<\/p>\n
            self._insert_recursive(self.root, value)<\/p>\n
    def _insert_recursive(self, current, value):<\/p>\n
        if value < current.value:<\/p>\n
            if current.left is None:<\/p>\n
                current.left = TreeNode(value)<\/p>\n
            else:<\/p>\n
                self._insert_recursive(current.left, value)<\/p>\n
        elif value > current.value:<\/p>\n
            if current.right is None:<\/p>\n
                current.right = TreeNode(value)<\/p>\n
            else:<\/p>\n
                self._insert_recursive(current.right, value)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e09\u3001\u5b9e\u73b0\u641c\u7d22\u8282\u70b9\u529f\u80fd<\/h3>\n<\/p>\n
\u641c\u7d22\u529f\u80fd\u4f7f\u6211\u4eec\u80fd\u591f\u5728\u6811\u4e2d\u67e5\u627e\u7279\u5b9a\u7684\u503c\u3002\u5bf9\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\uff0c\u641c\u7d22\u53ef\u4ee5\u9ad8\u6548\u5730\u8fdb\u884c\u3002<\/p>\n<\/p>\n
class BinarySearchTree(BinarySearchTree):<\/p>\n
    def search(self, value):<\/p>\n
        return self._search_recursive(self.root, value)<\/p>\n
    def _search_recursive(self, current, value):<\/p>\n
        if current is None or current.value == value:<\/p>\n
            return current<\/p>\n
        if value < current.value:<\/p>\n
            return self._search_recursive(current.left, value)<\/p>\n
        return self._search_recursive(current.right, value)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u56db\u3001\u5b9e\u73b0\u5220\u9664\u8282\u70b9\u529f\u80fd<\/h3>\n<\/p>\n
\u5220\u9664\u8282\u70b9\u662f\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u6700\u590d\u6742\u7684\u64cd\u4f5c\u4e4b\u4e00\u3002\u6839\u636e\u8282\u70b9\u7684\u5b69\u5b50\u6570\uff0c\u6211\u4eec\u53ef\u80fd\u9700\u8981\u91cd\u7ec4\u6811\u4ee5\u4fdd\u6301\u5176\u6027\u8d28\u3002<\/p>\n<\/p>\n
class BinarySearchTree(BinarySearchTree):<\/p>\n
    def delete(self, value):<\/p>\n
        self.root = self._delete_recursive(self.root, value)<\/p>\n
    def _delete_recursive(self, current, value):<\/p>\n
        if current is None:<\/p>\n
            return current<\/p>\n
        if value < current.value:<\/p>\n
            current.left = self._delete_recursive(current.left, value)<\/p>\n
        elif value > current.value:<\/p>\n
            current.right = self._delete_recursive(current.right, value)<\/p>\n
        else:<\/p>\n
            if current.left is None:<\/p>\n
                return current.right<\/p>\n
            elif current.right is None:<\/p>\n
                return current.left<\/p>\n
            else:<\/p>\n
                min_larger_node = self._get_min(current.right)<\/p>\n
                current.value = min_larger_node.value<\/p>\n
                current.right = self._delete_recursive(current.right, min_larger_node.value)<\/p>\n
        return current<\/p>\n
    def _get_min(self, current):<\/p>\n
        while current.left is not None:<\/p>\n
            current = current.left<\/p>\n
        return current<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e94\u3001\u5b9e\u73b0\u6811\u7684\u904d\u5386\u529f\u80fd<\/h3>\n<\/p>\n
\u904d\u5386\u662f\u53e6\u4e00\u79cd\u57fa\u672c\u64cd\u4f5c\uff0c\u5141\u8bb8\u6211\u4eec\u6309\u7279\u5b9a\u987a\u5e8f\u8bbf\u95ee\u6811\u4e2d\u7684\u6240\u6709\u8282\u70b9\u3002\u5e38\u7528\u7684\u904d\u5386\u65b9\u5f0f\u6709\u524d\u5e8f\u904d\u5386\u3001\u4e2d\u5e8f\u904d\u5386\u548c\u540e\u5e8f\u904d\u5386\u3002<\/p>\n<\/p>\n
class BinarySearchTree(BinarySearchTree):<\/p>\n
    def inorder_traversal(self):<\/p>\n
        def _inorder_recursive(node):<\/p>\n
            if not node:<\/p>\n
                return []<\/p>\n
            return _inorder_recursive(node.left) + [node.value] + _inorder_recursive(node.right)<\/p>\n
        return _inorder_recursive(self.root)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u516d\u3001\u5b9e\u73b0\u6811\u7684\u5176\u4ed6\u8f85\u52a9\u529f\u80fd<\/h3>\n<\/p>\n
\u9664\u4e86\u4e0a\u8ff0\u529f\u80fd\uff0c\u6211\u4eec\u8fd8\u53ef\u80fd\u60f3\u5b9e\u73b0\u4e00\u4e9b\u5176\u4ed6\u8f85\u52a9\u529f\u80fd\uff0c\u5982\u8ba1\u7b97\u6811\u7684\u9ad8\u5ea6\u3001\u67e5\u627e\u6700\u5c0f\u548c\u6700\u5927\u503c\u8282\u70b9\u3001\u68c0\u67e5\u6811\u662f\u5426\u5e73\u8861\u7b49\u3002<\/p>\n<\/p>\n
class BinarySearchTree(BinarySearchTree):<\/p>\n
    def height(self):<\/p>\n
        def _height_recursive(node):<\/p>\n
            if not node:<\/p>\n
                return 0<\/p>\n
            return max(_height_recursive(node.left), _height_recursive(node.right)) + 1<\/p>\n
        return _height_recursive(self.root)<\/p>\n
    def find_min(self):<\/p>\n
        current = self.root<\/p>\n
        while current.left is not None:<\/p>\n
            current = current.left<\/p>\n
        return current.value if current else None<\/p>\n
    def find_max(self):<\/p>\n
        current = self.root<\/p>\n
        while current.right is not None:<\/p>\n
            current = current.right<\/p>\n
        return current.value if current else None<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u901a\u8fc7\u8fd9\u4e9b\u57fa\u672c\u64cd\u4f5c\u7684\u5b9e\u73b0\uff0c\u6211\u4eec\u5df2\u7ecf\u62e5\u6709\u4e86\u4e00\u4e2a\u529f\u80fd\u5b8c\u5584\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u3002\u5f53\u7136\uff0c\u8fd8\u53ef\u4ee5\u7ee7\u7eed\u6dfb\u52a0\u66f4\u591a\u9ad8\u7ea7\u529f\u80fd\uff0c\u4f8b\u5982\u65cb\u8f6c\u64cd\u4f5c\u4ee5\u4fdd\u6301\u6811\u5e73\u8861\uff08AVL\u6811\u6216\u7ea2\u9ed1\u6811\uff09\u3002\u8fd9\u4e9b\u64cd\u4f5c\u7684\u5b9e\u73b0\u66f4\u4e3a\u590d\u6742\uff0c\u9700\u8981\u66f4\u591a\u8003\u8651\u7ef4\u6301\u6811\u7684\u5e73\u8861\u6027\u4e0e\u6027\u80fd\u3002<\/p>\n<\/p>\n
\u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n
1. \u4e8c\u53c9\u641c\u7d22\u6811\u7684\u57fa\u672c\u7279\u70b9\u662f\u4ec0\u4e48\uff1f<\/strong>
\n\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u4e00\u79cd\u6709\u5e8f\u7684\u4e8c\u53c9\u6811\uff0c\u5177\u6709\u4ee5\u4e0b\u7279\u70b9\uff1a<\/p>\n
    \n
  • \u5de6\u5b50\u6811\u7684\u6240\u6709\u8282\u70b9\u7684\u503c\u90fd\u5c0f\u4e8e\u6839\u8282\u70b9\u7684\u503c\uff1b<\/li>\n
  • \u53f3\u5b50\u6811\u7684\u6240\u6709\u8282\u70b9\u7684\u503c\u90fd\u5927\u4e8e\u6839\u8282\u70b9\u7684\u503c\uff1b<\/li>\n
  • \u5de6\u5b50\u6811\u548c\u53f3\u5b50\u6811\u4e5f\u90fd\u662f\u4e8c\u53c9\u641c\u7d22\u6811\u3002<\/li>\n<\/ul>\n
    2. \u5982\u4f55\u5728Python\u4e2d\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\uff1f<\/strong>
    \n\u5728Python\u4e2d\uff0c\u53ef\u4ee5\u4f7f\u7528\u7c7b\u548c\u8282\u70b9\u6765\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u3002\u53ef\u4ee5\u521b\u5efa\u4e00\u4e2aNode\u7c7b\u8868\u793a\u4e8c\u53c9\u6811\u7684\u8282\u70b9\uff0c\u8282\u70b9\u5bf9\u8c61\u5305\u542b\u4e00\u4e2a\u503c\u5b57\u6bb5\u548c\u6307\u5411\u5de6\u53f3\u5b50\u8282\u70b9\u7684\u6307\u9488\uff1b\u540c\u65f6\uff0c\u53ef\u4ee5\u521b\u5efa\u4e00\u4e2aBinarySearchTree\u7c7b\u6765\u5305\u542b\u6811\u7684\u64cd\u4f5c\u65b9\u6cd5\uff0c\u5982\u63d2\u5165\u8282\u70b9\u3001\u5220\u9664\u8282\u70b9\u3001\u67e5\u627e\u8282\u70b9\u7b49\u3002<\/p>\n
    3. \u5982\u4f55\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u64cd\u4f5c\uff1f<\/strong>
    \n\u53ef\u4ee5\u901a\u8fc7\u9012\u5f52\u7684\u65b9\u5f0f\u5b9e\u73b0\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u63d2\u5165\u64cd\u4f5c\u3002\u5177\u4f53\u6b65\u9aa4\u5982\u4e0b\uff1a<\/p>\n
      \n
    • \u5982\u679c\u6811\u4e3a\u7a7a\uff0c\u5c06\u8981\u63d2\u5165\u7684\u8282\u70b9\u4f5c\u4e3a\u6839\u8282\u70b9\uff1b<\/li>\n
    • \u5982\u679c\u8981\u63d2\u5165\u7684\u8282\u70b9\u7684\u503c\u5c0f\u4e8e\u5f53\u524d\u8282\u70b9\u7684\u503c\uff0c\u5c06\u8282\u70b9\u63d2\u5165\u5f53\u524d\u8282\u70b9\u7684\u5de6\u5b50\u6811\u4e2d\uff1b<\/li>\n
    • \u5982\u679c\u8981\u63d2\u5165\u7684\u8282\u70b9\u7684\u503c\u5927\u4e8e\u5f53\u524d\u8282\u70b9\u7684\u503c\uff0c\u5c06\u8282\u70b9\u63d2\u5165\u5f53\u524d\u8282\u70b9\u7684\u53f3\u5b50\u6811\u4e2d\uff1b<\/li>\n
    • \u9012\u5f52\u6267\u884c\u4e0a\u8ff0\u6b65\u9aa4\uff0c\u76f4\u5230\u627e\u5230\u5408\u9002\u7684\u4f4d\u7f6e\u63d2\u5165\u8282\u70b9\u3002<\/li>\n<\/ul>\n
      \u9700\u8981\u6ce8\u610f\u7684\u662f\uff0c\u5728\u63d2\u5165\u8282\u70b9\u65f6\u8fd8\u8981\u8003\u8651\u91cd\u590d\u503c\u7684\u60c5\u51b5\uff0c\u53ef\u4ee5\u6839\u636e\u81ea\u5df1\u7684\u9700\u6c42\u51b3\u5b9a\u662f\u5426\u5141\u8bb8\u91cd\u590d\u503c\u5b58\u5728\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u4e00\u79cd\u7279\u6b8a\u7684\u4e8c\u53c9\u6811\uff0c\u5b83\u5177\u6709\u4ee5\u4e0b\u6027\u8d28\uff1a\u6bcf\u4e2a\u8282\u70b9\u7684\u5de6\u5b50\u6811\u53ea\u5305\u542b\u5c0f\u4e8e\u5f53\u524d\u8282\u70b9\u7684\u6570\u3001\u6bcf\u4e2a\u8282\u70b9\u7684\u53f3\u5b50\u6811\u53ea\u5305\u542b\u5927 […]","protected":false},"author":3,"featured_media":315385,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[37],"tags":[],"acf":[],"_links":{"self":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/315357"}],"collection":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/comments?post=315357"}],"version-history":[{"count":0,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/315357\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/315385"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=315357"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=315357"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=315357"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}