劍指面試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

>>阅读原文<<