Update 二叉树的递归遍历.md

Author: skylarkkk

problems/二叉树的递归遍历.md

@@ -189,7 +189,7 @@ class Solution:
             res.append(node.val)
             dfs(node.left)
             dfs(node.right)
-        
+        dfs(root)
         return res
 
 ```
@@ -206,7 +206,7 @@ class Solution:
             dfs(node.left)
             res.append(node.val)
             dfs(node.right)
-        
+        dfs(root)
         return res
 ```
 ```python
@@ -224,7 +224,7 @@ class Solution:
             dfs(node.left)
             dfs(node.right)
             res.append(node.val)
-        
+        dfs(root)
         return res
 ```