diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
index 6e768ec7..69c23e5c 100644
--- a/problems/二叉树的统一迭代法.md
+++ b/problems/二叉树的统一迭代法.md
@@ -695,7 +695,7 @@ impl Solution{
         res
     }
     // 中序
-        pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+    pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
         let mut res = vec![];
         let mut stack = vec![];
         if root.is_some() {