[LeetCode] Symmetric Tree
来源:互联网 发布:淘宝试用成功怎么领取 编辑:程序博客网 时间:2024/06/05 11:21
题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
判断二叉树是否对称。
思路:中序遍历,判断是否对称。
注意:为空的节点是否在树的深度内。对于非叶子节点的空子结点,需要在中序遍历中记录。
class Solution {public: vector<int> v; bool isSymmetric(TreeNode *root) { inorderTravers(root); for(int i =0,j=v.size()-1;i<j;i++,j--) { if(v[i]!=v[j]) return false; } return true; } void inorderTravers(TreeNode *root) { if(root!=NULL) { if(root->left==NULL && root->right==NULL) { v.push_back(root->val); return; } inorderTravers(root->left); v.push_back(root->val); inorderTravers(root->right); } else v.push_back(-1000000); }};
0 0
- Leetcode - Tree - Symmetric Tree
- Leetcode - Tree - Symmetric Tree
- LeetCode[Tree]: Symmetric Tree
- [leetcode][tree] Symmetric Tree
- LeetCode: Symmetric Tree
- [Leetcode] Symmetric Tree
- LeetCode : Symmetric Tree
- leetcode 13:symmetric tree
- [LeetCode] Symmetric Tree - Recursively
- [LeetCode] Symmetric Tree - Iteratively
- [LeetCode] Symmetric Tree
- [LeetCode]Symmetric Tree
- Leetcode:Symmetric Tree
- [Leetcode]Symmetric Tree
- Leetcode: Symmetric Tree
- [leetcode]Symmetric Tree
- LeetCode-Symmetric Tree
- [leetcode] Symmetric Tree
- android的一些文章
- javascript书籍推荐
- [LeetCode]Merge Two Sorted Lists
- [LeetCode]Palindrome Number,解题报告
- 15分钟学会使用Git和远程代码库
- [LeetCode] Symmetric Tree
- js 跳出页面的frameset框架
- ubuntu 12.10 安装 bcm4312无线网卡驱动
- 高性能服务器设计——模块间通信
- 模拟器inter x86的安装方法
- 2013~2014 第一学期课件整理
- 设计模式-策略模式
- ava中的值传递和引用传递
- JAVA笔记【20131221】