add the python solution of 0094 and 0096.

Author: Mrtj2016

solution/0094.Binary Tree Inorder Traversal/Solution.py

@@ -0,0 +1,44 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+# 递归版本
+"""
+class Solution:
+    def inorderTraversal(self, root):
+        """
+        : type root: TreeNode
+        : rtype: List[int]
+        """
+        def dp(node):
+            if not node:
+                return
+            dp(node.left)
+            ls.append(node.val)
+            dp(node.right)
+        ls=[]
+        dp(root)
+        return ls
+"""
+
+# 非递归版本
+class Solution:
+    def inorderTraversal(self, root):
+        """
+        :type root: TreeNode
+        :rtype: List[int]
+        """
+        ls = []
+        stack = []
+        while root or stack:
+            while root:
+                stack.append(root)
+                root = root.left
+            if stack:
+                root = stack.pop(-1)
+                ls.append(root.val)
+                root = root.right
+        return ls

solution/0096.Unique Binary Search Trees/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def numTrees(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        res = [0] * (n + 1)
+        res[0] = 1
+        for i in range(1, n + 1):
+            for j in range(i):
+                res[i] += res[j] * res[i - j - 1]
+        return res[n]