leetcode - Same Tree

题目：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.

个人思路：

1、比较两棵树是否相同，先比较根节点是否相同，再分别比较左子树和右子树是否相同，可以看出这是一个递归的过程，一般树的题目都会涉及递归

代码：

 1 #include <stddef.h>
 2 /*
 3 struct TreeNode
 4 {
 5     int val;
 6     TreeNode *left;
 7     TreeNode *right;
 8     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 9 };
10 */
11 class Solution
12 {
13 public:
14     bool isSameTree(TreeNode *p, TreeNode *q)
15     {
16         //p,q均为空
17         if (p == NULL && q == NULL)
18         {
19             return true;
20         }
21
22         //p,q不为空时，p,q指向结点的值相同且p,q左右子树均相同，则说明p,q指向的树相同
23         if (p != NULL && q != NULL && p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right))
24         {
25             return true;
26         }
27
28         return false;
29     }
30 };

View Code

按照惯例，到网上搜寻是否有更好的方法，发现大部分都是采用这种递归的思路，就这样吧

转载于:https://www.cnblogs.com/laihaiteng/p/3786077.html

leetcode - Same Tree相关推荐

[LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
目录: 1.Binary Tree Level Order Traversal - 二叉树层次遍历 BFS 2.Binary Tree Level Order Traversal II - 二叉树层次 ...
Leetcode | Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. ...
LeetCode N-ary Tree Level Order Traversal(bfs)
问题:给出一个n叉树,输出层次遍历思路:bfs 具体代码参考: https://github.com/wuli2496/OJ/tree/master/LeetCode/N-ary%20Tree%20 ...
LeetCode Binary Tree Right Side View(搜索)
问题:给出一个二叉树,要求输出右视图思路:因为要求输出右视图.可以考虑使用深度优先搜索或者广度优先搜索. 使用深度优先搜索时,以非递归形式,将左右子树入栈,同时使用哈希表记录深度与对应右视图的值. ...
LeetCode Binary Tree Preorder Traversal(二叉树的前序遍历)
问题:给出一个二叉树,输出前序遍历思路: 自顶向下遍历过程中,将当前结点的值加入到list中,然后处理左.右子树具体代码参考: https://github.com/wuli2496/OJ/tre ...
[LeetCode] Binary Tree Postorder Traversal 二叉树的后序遍历
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary ...
[LeetCode] Binary Tree Postorder题解
Binary Tree Postorder Given a binary tree, return the postorder traversal of its nodes' values. For ...
[Leetcode] Binary Tree Maximum Path Sum
这是LeetCode上的一道题目,需要求二叉树中两点路径的最大和.原题是 https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/ ...
[LeetCode] N-ary Tree Postorder Traversal N叉树的后序遍历
Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary ...
[leetcode] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...

leetcode - Same Tree

leetcode - Same Tree相关推荐

最新文章

热门文章