Merge Two Binary Trees

功能驱动迭代

class Solution(object):
    def mergeTrees(self, t1, t2):
    	if not t1 and not t2:
    		return
    	if t1 and not t2:
    		return t1
    	if t2 and not t1:
    		return t2
    	t1.val = t1.val + t2.val
    	t1.left = self.mergeTrees(t1.left,t2.left)
    	t1.right = self.mergeTrees(t1.right,t2.right)
    	return t1