leetcode#101 Symmetric Tree
来源:互联网 发布:怎么在淘宝上注册开店 编辑:程序博客网 时间:2024/06/15 10:11
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
But the following [1,2,2,null,3,null,3] is not:
由于这道题data structure是二叉树,所以很容易就能想到递归地求解。所以我写了一个compareMirror
的函数来判断其对称性。然后对于每一个节点地柜调用该函数即可。
/** * 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 isSymmetric(TreeNode* root) { if (root == NULL) return true; return compareMirror(root->left, root->right); } bool compareMirror(TreeNode* ln, TreeNode* rn) { if (ln != NULL && rn != NULL) { return ln->val == rn->val && compareMirror(ln->left, rn->right) && compareMirror(ln->right, rn->left); } else if (ln == NULL && rn == NULL) return true; return false; }};
0 0
- LeetCode(101)Symmetric Tree
- LeetCode 101 Symmetric Tree
- LeetCode: Symmetric Tree [101]
- [leetcode 101] Symmetric Tree
- [LeetCode 101]Symmetric Tree
- leetcode-101 Symmetric Tree
- leetcode || 101、Symmetric Tree
- Leetcode[101]-Symmetric Tree
- leetcode[101]:Symmetric Tree
- LeetCode 101 Symmetric Tree
- leetcode 101 Symmetric Tree
- Leetcode# 101 Symmetric Tree
- leetcode 101: Symmetric Tree
- leetCode #101 Symmetric Tree
- leetcode-101-Symmetric Tree
- leetcode 101 Symmetric Tree
- LeetCode 101: Symmetric Tree
- 【LEETCODE】101-Symmetric Tree
- cuda8.0使用pbo与opengl交互
- P1209 修理牛棚
- linux学习记录(1)
- 按之字形打印二叉树的节点【两个栈实现】
- ajax学习笔记
- leetcode#101 Symmetric Tree
- JAVA第三大特性-----多态
- 友善网
- Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals) A. Andryusha and Colored Balloons
- 求0到n之间所有数字中1的个数和
- HDU4812:D Tree
- CCF 201512-1
- QThread中的互斥、读写锁、信号量、条件变量
- L1-030. 一帮一