算法分析与设计——LeetCode:101. Symmetric Tree
2018-03-06 13:55
429 查看
题目
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 following
[1,2,2,null,3,null,3]is not:
1
/ \
2 2
\ \
3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
/** * 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) { } };
思路
方法1用递归逐步判断左右两边是否对称,方法2则利用了队列进行了同样的过程。代码
方法1/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(
4000
NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if (root == NULL) {
return true;
} else {
return isSymmetric(root -> left, root -> right);
}
}
bool isSymmetric(TreeNode* left, TreeNode* right) {
if (left == NULL && right == NULL) {
return true;
} else if (left == NULL || right == NULL) {
return false;
} else if (left -> val != right -> val) {
return false;
}
return isSymmetric(left -> left, right -> right) && isSymmetric(left -> right, right -> left);
}
};方法2
/** * 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; } queue<TreeNode*> q1, q2; q1.push(root -> left); q2.push(root -> right); while (!q1.empty() && !q2.empty()) { TreeNode *left_; TreeNode *right_; left_ = q1.front(); right_ = q2.front(); q1.pop(); q2.pop(); if (left_ == NULL && right_ == NULL) { continue; } else if (left_ == NULL || right_ == NULL) { return false; } else if (left_ -> val != right_ -> val) { return false; } q1.push(left_ -> right); q1.push(left_ -> left); q2.push(right_ -> left); q2.push(right_ -> right); } return true; } };
相关文章推荐
- 算法分析与设计——LeetCode:104. Maximum Depth of Binary Tree
- [算法分析与设计] leetcode 每周一题: Validate Binary Search Tree
- 算法分析与设计——LeetCode Problem.98 Validate Binary Search Tree
- 算法分析与设计——LeetCode Problem.538 Convert BST to Greater Tree
- 算法分析与设计丨第十八周丨LeetCode(21)——Binary Tree Maximum Path Sum(Hard)
- 算法分析与设计丨第三周丨LeetCode(6)——Find Largest Value in Each Tree Row(Medium)
- [算法分析与设计] leetcode 每周一题: UTF-8 Validation
- 算法分析与设计——LeetCode:2.Add Two Numbers
- 算法分析与设计——LeetCode:62. Unique Paths
- [算法分析与设计] leetcode 每周一题: 078. Subsets
- 算法分析与设计课程——LeetCode刷题之4Sum
- [算法分析与设计] leetcode 每周一题: 053. Maximum Subarray
- 算法分析与设计课程(11):【leetcode】Gray Code
- [算法分析与设计] leetcode 每周一题: 554. Brick Wall
- [算法分析与设计] leetcode 每周一题: 328. Odd Even Linked List
- 第十四周算法分析与设计:Binary Tree Preorder Traversal
- 算法设计与分析 HW6:LeetCode 54
- [算法分析与设计] leetcode 每周一题:132 Pattern
- 算法分析与设计课程——LeetCode刷题之Merge Two Sorted Lists
- 算法分析与设计丨第一周丨LeetCode(2)——Different Ways to Add Parentheses(Medium)