Leetcode---Symmetric Tree

最新推荐文章于 2019-08-20 23:28:46 发布
最新推荐文章于 2019-08-20 23:28:46 发布
阅读量396 收藏
点赞数
分类专栏： Leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/ffmpeg4976/article/details/42340445
版权

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric: 

    1
   / \
  2   2
 / \ / \
3  4 4  3


But the following is not: 

    1
   / \
  2   2
   \   \
   3    3


判断一棵树是不是镜像。关于树，直接的想法就是递归，但是这个题目从单个树来看是无法递归的，但是可以用两个树来递归。


  1. bool f(TreeNode * l, TreeNode * r){
  2.     if(l==NULL && r==NULL)
  3.         return true;
  4.     if(l==NULL || r==NULL)
  5.         return false;
  6.     return l->val==r->val && f(l->left,r->right)&&
  7.         f(l->right,r->left);
  8. }
  9. bool isSymmetric(TreeNode *root) {
  10.     if(root==NULL)
  11.         return true;
  12.     return f(root->left,root->right);
  13. }



<script>window._bd_share_config={"common":{"bdSnsKey":{},"bdText":"","bdMini":"2","bdMiniList":false,"bdPic":"","bdStyle":"0","bdSize":"16"},"share":{}};with(document)0[(getElementsByTagName('head')[0]||body).appendChild(createElement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new Date()/36e5)];</script>
阅读(7) | 评论(0) | 转发(0) |
0

上一篇：如何正确的写出二分查找算法

下一篇：Leetcode---Maximum Depth of Binary Tree

相关热门文章
给主人留下些什么吧！~~
评论热议
我把葡萄酿成酒
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
leetcodetreenode-LeetCode---Symmetric-Tree:给定一棵二叉树，检查它是否是自身的镜像（即围绕其中心对称
07-01
isSymmetric(TreeNode root) { if(root == NULL) return true; return checkSymmetric(root->left, root->right); } bool checkSymmetric(TreeNode* left, TreeNode* right) { if(left == NULL && right == NULL) ...
LeetCode-symmetric-tree
六月二十七的博客
04-03 109
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the followi...
leetCode---Symmetric Tree
jingxichen_的专栏
06-21 144
一. 题目：Number of Islands Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontall
LeetCode---Symmetric Tree
找到生活的 节奏&&驱动力
11-03 338
题目大意：给出一个二叉树，判断该树是否关于根节点是中心对称的。 算法思想： 如果一个二叉树是中心对称的，则说明其左右子树对称，由二叉树的性质可知通过前序遍历结果和后序遍历结果可以确定一个二叉树的结构。这样对于对称二叉树，通过将先左子树进行正常的先序和后序遍历，对右子树也进行先序和后序遍历，但注意需要改变一下遍历其左右子树的顺序。无论是先序还是后序左右子树的遍历结果应该相同。如果不相同则不是中心
LeetCode--symmetric-tree
wl_ss的博客
01-08 180
题目描述 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3
Leetcode-Symmetric Tree
嘤其鸣矣，求其友声
08-26 334
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the
leetcode -- Symmetric Tree
08-11 77
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But th...
leetcode--Symmetric Tree
weixin_30951389的博客
08-20 83
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But ...
LeetCode-Symmetric Tree
坟头草一米七五
11-09 89
LeetCode Java Symmetric Tree
LeetCode - symmetric-tree
toward_south的博客
04-07 73
题目： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the fo...
四平方和定理leetcode-leetcode-practice:个人LeetCode练习代码
06-30
94.binary-tree-inorder-traversal (二叉树的中序遍历) 101.symmetric-tree (对称二叉树) 102.binary-tree-level-order-traversal (二叉树的层序遍历) 104.maximum-depth-of-binary-tree (二叉树的最大深度) 105....
leetcode答案-LeetCode-Trip:LeetCode刷题代码，大佬勿入
06-30
leetcode 答案 LeetCode-Trip ...Symmetric Tree] [104. Maximum Depth of Binary Tree] [121. Best Time to Buy and Sell Stock] [167. Two Sum II - Input array is sorted] Medium [2. Add Two Numbers]
lrucacheleetcode-luoleet:LeetcodesolutionsbyXinhangLuoandQinghaoDai
06-29
https://leetcode.com/problems/binary-tree-level-order-traversal/ Binary Tree Level Order Traversal 103 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Binary Tree Zigzag Level ...
leetcode分发糖果-ForDaFactory:使用C++的个人leetcode解决方案
06-30
leetcode分发糖果 Leetcode C++ Solution Don't try to understand it, feel ...21-合并两个有序链表:merge-two-sorted-lists 83-删除排序链表中的重复元素:remove-duplicates-from-sorted-...101-对称二叉树:symmetric-
Leetcode---Implement strStr()
Walk More Slowly
01-02 739
Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 我试着用了最简单的匹配，居然过了，以后再用KMP之类的好好研究一下。 char *str
Leetcode题目索引
Walk More Slowly
01-02 650
1 Two Sum Medium 2 Add Two Numbers Medium 3 Longest Substring Without Repeating Characters Medium 4 Median of Two Sorted Arrays Hard 5 Longest Palindromic Substring Mediu
Leetcode---Recover Binary Search Tree
Walk More Slowly
04-06 563
一个二叉排序树的某两个节点颠倒了为了，去恢复它。 不可思议的是这道题居然被标记为了hard，其实难度远低于其他的hard或medium。 思路：中序遍历，然后看是不是递增的，如果不是，记录下来。注意，可能有一次逆序，也可能有两次，一次的发生在相邻节点。 注意，中序遍历是这样的： void f(node * root){ if(root==NULL) return; f
Leetcode---Surrounded Regions
Walk More Slowly
04-12 519
Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, X X X X X O O X X X
idea leetcode-edito乱码
最新发布
09-01
LeetCode-Editor是一种在线编码工具，它提供了一个用户友好的界面编写和运行代码。在使用LeetCode-Editor时，有时候会出现乱码的问题。 乱码的原因可能是由于编码格式不兼容或者编码错误导致的。在这种情况下，我们...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值