首页 > 代码库 > LeetCode 101:Symmetric Tree
LeetCode 101:Symmetric Tree
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
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) { if (root == NULL) return true; else { return ifSymmetric(root->left,root->right); } } bool ifSymmetric(TreeNode* tree1, TreeNode* tree2){ if (tree1==NULL && tree2==NULL) return true; else if (tree1 == NULL || tree2 == NULL) return false; if (tree1->val != tree2->val) return false; else { return ifSymmetric(tree1->left, tree2->right) && ifSymmetric(tree1->right, tree2->left); } } };
LeetCode 101:Symmetric Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。