572. Subtree of Another Tree(子树)
发布时间:2020-12-14 04:36:26 所属栏目:大数据 来源:网络整理
导读: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?sand all of this node‘s descendants. The tree?s?could also be
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?sand all of this node‘s descendants. The tree?s?could also be considered as a subtree of itself. Example 1: 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: 3 / 4 5 / 1 2 / 0 Given tree t: 4 / 1 2 方法一:递归 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public boolean isSubtree(TreeNode s,TreeNode t) { if(s==null) return false; (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |