From 839afd119b4a22700a374f555a0ee8d1eebd9495 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=AB=98=E9=98=94?= <gaokuo@gaokuodeMacBook-Pro.local>
Date: Sat, 9 Sep 2023 10:23:43 +0800
Subject: [PATCH] test

---
 problems/0111.二叉树的最小深度.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/0111.二叉树的最小深度.md b/problems/0111.二叉树的最小深度.md
index 61f9beb7..8b9d92e6 100644
--- a/problems/0111.二叉树的最小深度.md
+++ b/problems/0111.二叉树的最小深度.md
@@ -173,12 +173,12 @@ private:
     int result;
     void getdepth(TreeNode* node, int depth) {
         // 函数递归终止条件
-        if (root == nullptr) {
+        if (node == nullptr) {
             return;
         }
         // 中，处理逻辑：判断是不是叶子结点
-        if (root -> left == nullptr && root->right == nullptr) {
-            res = min(res, depth);
+        if (node -> left == nullptr && node->right == nullptr) {
+            result = min(result, depth);
         }
         if (node->left) { // 左
             getdepth(node->left, depth + 1);