LeetCode - 572. Subtree of Another Tree

检查二叉树子结构

最新推荐文章于 2025-07-29 14:24:32 发布

转载最新推荐文章于 2025-07-29 14:24:32 发布 · 93 阅读

本文介绍了一种算法，用于判断一棵二叉树是否为另一棵二叉树的子结构。通过递归方法，该算法能有效确定两棵树是否具有相同的结构及节点值。

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:

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:

Given tree t:

   4
  / \
 1   2

Return false.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }    
 */
public class Solution {
    
    public boolean isSubtree(TreeNode s, TreeNode t) {
        if (s == null && t != null) return false;
        if (s == null && t == null) return true;
        if (s != null && t == null) return false;
        
        if (s.val == t.val) {
            if (isGoOn(s, t)) return true;
        }
        return isSubtree(s.left, t) || isSubtree(s.right, t);
    }
    
    private boolean isGoOn(TreeNode s, TreeNode t) {
        if (s == null && t != null) return false;
        if (s == null && t == null) return true;
        if (s != null && t == null) return false;
        
        if (s.val == t.val) {
            return isGoOn(s.left, t.left) && isGoOn(s.right, t.right);
        }
        else return false;
    }
    
}