剑指offer牛客网练习20200125

1.树的子结构

这一题我其实思路不是很明确，是看了讨论区的

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def HasSubtree(self, pRoot1, pRoot2):
        # write code here
        result=False
        if pRoot1!=None and pRoot2!=None:
            if pRoot1.val==pRoot1.val:
                result=DoesTree1hasTree2(pRoot1,pRoot2)
            if not result:
                result=self.HasSubtree(pRoot1.left,pRoot2)
            if not result:
                result=self.HasSubtree(pRoot1.right,pRoot2)
        return result
def DoesTree1hasTree2(tree1,tree2):
#循环的终止条件应该是遍历到了B的叶节点，而不是A的，如果A为null，B也为null也是应该要返回true，所以前两个if不能换
    if tree2==None:
        return True
    if tree1==None:
        return False
    if tree1.val!=tree2.val:
        return False
    return DoesTree1hasTree2(tree1.left,tree2.left) and DoesTree1hasTree2(tree1.right,tree2.right)

 

2.二叉树的镜像

就是翻转吧，用了递归的思想

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # 返回镜像树的根节点
    def Mirror(self, root):
        # write code here
#这个if是为了当root为None时不要做下面的三个步骤，终止递归
        if root==None:
            return None
        root.left,root.right=root.right,root.left
        self.Mirror(root.left)
        self.Mirror(root.right)
        return root