剑指面试26-数的子结构

题目：输入两棵二叉树A和B，判断B是不是A的子结构。 # -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def HasSubtree(self, pRoot1, pRoo

>>阅读原文<<