Add python Solution

Author: qinyii

Problems/07-All-Elements-in-Two-Binary-Search-Trees/All_elements.py

@@ -0,0 +1,26 @@
+class Solution:
+    def getAllElements(self, root1, root2) :
+        def inorder(node, res):
+            if node:
+                inorder(node.left, res)
+                res.append(node.val)
+                inorder(node.right, res)
+        res,inor1,inor2 = [],[],[]  
+        inorder(root1,inor1)
+        inorder(root2,inor2)
+        l1, r1 = 0, len(inor1)
+        l2, r2 = 0, len(inor2)
+        while True:
+            if l1 == r1:
+                res.extend(inor2[l2:])
+                break
+            if l2 == r2:
+                res.extend(inor1[l1:])
+                break
+            if inor1[l1] < inor2[l2]:
+                res.append(inor1[l1])
+                l1 += 1
+            else:
+                res.append(inor2[l2])
+                l2 += 1
+        return res

Problems/08-Search-Insert-Position/Search-Insert-Position.py

@@ -0,0 +1,21 @@
+class Solution(object):
+    def searchInsert(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: int
+        """
+        l = len(nums)
+        i = 0 
+        j = l-1
+        res = l
+        while (i<=j):
+            mid = (i+j)/2
+            if target == nums[mid]: 
+                res = mid
+                break
+            elif target < nums[mid]: 
+                res = mid
+                j = mid -1
+            else: i = mid+1
+        return res