leetcode笔记:Same Tree
2017-08-13 16:29
267 查看
一. 题目描写叙述
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.
二. 题目分析
题目的意思非常easy,推断两棵树是否同样,递归,对两棵树的结点进行比較就可以。
三. 演示样例代码
四. 小结
该题属于二叉树的遍历中的基础题目,难度不大。
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.
二. 题目分析
题目的意思非常easy,推断两棵树是否同样,递归,对两棵树的结点进行比較就可以。
三. 演示样例代码
#include <iostream> using namespace std; 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; // p和q不同一时候到达叶节点,则剪枝 else if ((p != NULL && q == NULL) || (p == NULL && q != NULL)) return false; return (p->val == q->val) && isSameTree(p->left, q->left) && isSameTree(p->right, q->right); } };
四. 小结
该题属于二叉树的遍历中的基础题目,难度不大。
相关文章推荐
- leetcode笔记:Same Tree
- LeetCode 100:Same Tree
- [LeetCode] 093: Same Tree
- LeetCode -- Same Tree
- 【leetcode刷题笔记】Validate Binary Search Tree
- leetcode100 Same Tree java
- LeetCode Same Tree
- leetcode笔记:Minimum Depth of Binary Tree
- Leetcode: Same Tree
- [leetcode]_Same Tree
- Leetcode 笔记 99 - Recover Binary Search Tree
- LeetCode之Same Tree
- leetcode 100 SameTree 3行
- leetcode:100 Same Tree-每日编程第六题
- LeetCode Same Tree
- LeetCode Same Tree
- LeetCode笔记:235. Lowest Common Ancestor of a Binary Search Tree
- LeetCode Same Tree
- 【一天一道LeetCode】#100. Same Tree(100题大关)
- Same Tree problem on leetcode