Update 99. 把二叉搜索树转换为累加树.md

Author: jasoncao11

99. 把二叉搜索树转换为累加树.md

@@ -19,6 +19,6 @@ class Solution:
             node.val = self.total
             dfs(node.left)
 
-        recur(root)
+        dfs(root)
         return root
 ```