class Solution { public: bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) { if(pRoot2 == nullptr || pRoot1 == nullptr) { return false; } queue<TreeNode*> que; //使用层序遍历 TreeNode *p1 = pRoot1; int sum = 0; ...