100. Same Tree

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

递归遍历左子树和右子树

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     TreeNode *left;*     TreeNode *right;*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/
class Solution {
public:bool isSameTree(TreeNode* p, TreeNode* q) {if (p == NULL && q == NULL) return true;if (p == NULL && q != NULL) return false;if (p != NULL && q == NULL) return false;if (p->val == q->val) {bool x = isSameTree(p->left, q->left);bool y = isSameTree(p->right, q->right);return x&&y;}return false;}
};

转载于:https://www.cnblogs.com/pk28/p/7218111.html

100. Same Tree相关推荐

LeetCode 100. Same Tree
LeetCode 100. Same Tree Solution1: 这种弱智题提交这么多次... /*** Definition for a binary tree node.* struct Tr ...
[Leetcode]100. Same Tree -David_Lin
Given two binary trees, write a function to check if they are equal or not. Two binary trees are con ...
[LeetCode] NO. 100 Same Tree
[题目] Given two binary trees, write a function to check if they are equal or not. Two binary trees ar ...
100. Same Tree同样的树
［抄题］: Given two binary trees, write a function to check if they are the same or not. Two binary tree ...
Leet Code OJ 100. Same Tree [Difficulty: Easy]
题目: Given two binary trees, write a function to check if they are equal or not. Two binary trees are ...
32/100. Binary Tree Inorder Traversal
中序遍历二叉树. 递归法: # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x) ...
16/100. Symmetric Tree
给定一个二叉树,看它是不是"镜像树"(瞎起的). 递归.从上往下,分别判断左右子树的根节点值是否相等,相等则继续往下递归,不等则返回False. # Definition for ...
[LeetCode]: 100: Same Tree
题目: Given two binary trees, write a function to check if they are equal or not. Two binary trees are ...
[leetcode]100.Same Tree
题目 Given two binary trees, write a function to check if they are the same or not. Two binary trees a ...

100. Same Tree

100. Same Tree相关推荐

最新文章

热门文章