feat: add solutions to lc problem: No.0144 (#2334)

No.0144.Binary Tree Preorder Traversal

Author: yanglbme

solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md

@@ -67,7 +67,6 @@ class Solution:
             if root is None:
                 return
             dfs(root.left)
-            nonlocal ans
             ans.append(root.val)
             dfs(root.right)
 

solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md

@@ -62,7 +62,6 @@ class Solution:
             if root is None:
                 return
             dfs(root.left)
-            nonlocal ans
             ans.append(root.val)
             dfs(root.right)
 

solution/0000-0099/0094.Binary Tree Inorder Traversal/Solution.py

@@ -10,7 +10,6 @@ def dfs(root):
             if root is None:
                 return
             dfs(root.left)
-            nonlocal ans
             ans.append(root.val)
             dfs(root.right)