Leetcode: Symmetric Tree
来源：互联网 发布：淘宝旺旺mac版 编辑：程序博客网 时间：2024/06/13 13:22
http://oj.leetcode.com/problems/symmetric-tree/
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: bool isEqual(TreeNode *left, TreeNode *right){ int cnt=0; if(left==NULL) cnt++; if(right==NULL) cnt++; if(cnt==2) return true; if(cnt==1) return false; if(left->val!=right->val) return false; if(isEqual(left->left,right->right)&&isEqual(left->right,right->left)) return true; else return false; } bool isSymmetric(TreeNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(root==NULL) return true; else return isEqual(root->left,root->right); }};- 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
- Use thrust reduce_by_key with raw pointers instead of device pointers
- Leetcode: Best Time to Buy and Sell Stock II
- Leetcode: Same Tree
- Leetcode: Maximum Depth of Binary Tree
- Leetcode: Reverse Integer
- Leetcode: Symmetric Tree
- Leetcode: Merge Sorted Array
- Leetcode: Climbing Stairs
- Leetcode: Remove Duplicates from Sorted List
- Leetcode: Search Insert Position
- Leetcode: Remove Duplicates from Sorted Array
- JS限制textbox或textarea输入字符长度
- Leetcode: Convert Sorted Array to Binary Search Tree
- Leetcode: Unique Binary Search Trees
