LeetCode 572. Subtree of Another Tree

最新推荐文章于 2017-09-21 14:11:56 发布

HelloSilicat

最新推荐文章于 2017-09-21 14:11:56 发布

阅读量235

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/peisir/article/details/77177147

版权

Leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

572. Subtree of Another Tree

Description

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’s descendants. The tree s could also be considered as a subtree of itself.

Example 1:
Given tree s:

     3
    / \
   4   5
  / \
 1   2

Given tree t:

   4 
  / \
 1   2

Return true, because t has the same structure and node values with a subtree of s.

Example 2:
Given tree s:

     3
    / \
   4   5
  / \
 1   2
    /
   0

Given tree t:

   4
  / \
 1   2

Return false.

Solution

题意即判断t二叉树是否是s的某一棵子树（子树得包含叶节点）。
我们可以先写一个判断是否为相同树的子函数，然后遍历s来判断是否存在s的某个子树和t相同，代码如下

class Solution {
public:
    bool isSameTree(TreeNode* s,TreeNode *t) {
        if ((s == NULL && t != NULL) || (s != NULL && t == NULL))
            return false;
        else if (s == NULL && t == NULL)
            return true;
        return s->val == t->val && isSameTree(s->left,t->left) && isSameTree(s->right,t->right);
    }
    bool isSubtree(TreeNode* s, TreeNode* t) {
        if (t == NULL || (s == NULL && t == NULL))
            return true;
        if (t != NULL && s == NULL)
            return false;
        if (isSameTree(s,t))
            return true;
        else 
            return isSubtree(s->left,t) || isSubtree(s->right,t);
    }
};