修复bst中删除节点时的代码错误

Author: hjlarry

docs/17_二叉查找树/binary_search_tree.md

@@ -216,7 +216,7 @@ bst = BST.build_from(NODE_LIST)
                     return subtree.right
             else:  # 俩孩子，寻找后继节点替换
                 successor_node = self._bst_min_node(subtree.right)
-                subtree.key, subtree.value = successor_node.key, subtree.value
+                subtree.key, subtree.value = successor_node.key, successor_node.value
                 subtree.right = self._bst_remove(subtree.right, successor_node.key)
                 return subtree
 

docs/17_二叉查找树/bst.py

@@ -106,7 +106,7 @@ def _bst_remove(self, subtree, key):
                     return subtree.right
             else:  # 俩孩子，寻找后继节点替换
                 successor_node = self._bst_min_node(subtree.right)
-                subtree.key, subtree.value = successor_node.key, subtree.value
+                subtree.key, subtree.value = successor_node.key, successor_node.value
                 subtree.right = self._bst_remove(subtree.right, successor_node.key)
                 return subtree