leetcode 101 Symmetric Tree

判定两棵树是否严格镜像对称。

解决：

BFS

bool isSymmetric(TreeNode* root) {if (root == NULL)return true;deque<TreeNode*> now;now.push_back(root->left);now.push_back(root->right);while (now.size() > 0) {int size = now.size();for (int i = 0; i < size / 2; ++i) {int left = now[i]?now[i]->val:NULL;int right = now[size - i - 1]?now[size - i - 1]->val:NULL;if (left != right)return false;}for (int i = 0; i < size; ++i) {TreeNode* n = now.front();now.pop_front();if (n) {now.push_back(n->left);now.push_back(n->right);}}}return true;
}

DFS

bool isSymmetric(TreeNode* root) {if(root==NULL)return true;return dfs(root->left,root->right);}bool dfs(TreeNode *left, TreeNode* right){if(left==NULL || right ==NULL)return left==right;return (left->val==right->val) && dfs(left->left,right->right) && dfs(left->right,right->left);}

转载于:https://www.cnblogs.com/willaty/p/8338479.html

leetcode 101 Symmetric Tree相关推荐

LeetCode 101. Symmetric Tree
LeetCode 101. Symmetric Tree Solution1 参考<剑指offer>上的解法:https://blog.csdn.net/allenlzcoder/arti ...
Leetcode: 101. Symmetric Tree
题目 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). Fo ...
【LeetCode 剑指offer刷题】树题6：28 对称二叉树（101. Symmetric Tree）
[LeetCode & 剑指offer 刷题笔记]目录(持续更新中...) 101. Symmetric Tree /** * Definition for a binary tree no ...
101. Symmetric Tree (C语言)
101. Symmetric Tree (C语言) 判断是否为左右镜面对称的二叉树题目 Given the root of a binary tree, check whether it is a ...
leetcode python3 简单题101. Symmetric Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零一题 (1)题目英文: Given a binary tree, chec ...
LeetCode Algorithm 101. Symmetric Tree
Title 给定一个二叉树,检查它是否是镜像对称的. 例如,二叉树 [1,2,2,3,4,4,3] 是对称的. 1/ \2 2/ \ / \ 3 4 4 3 但是下面这个 [1,2,2,null,3, ...
Leet Code OJ 101. Symmetric Tree [Difficulty: Easy]
题目: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). F ...
LeetCode OJ Symmetric Tree 判断是否为对称树（AC代码）
思路: 主要判断左子树与右子树. 在判断左时,循环下去肯定会到达叶子结点中最左边的结点与最右边的结点比较. 到了这一步因为他们都没有左(右)子树了,所以得开始判断这两个结点的右(左)子树了. 当某个结 ...
【easy】101. Symmetric Tree
判断一棵二叉树是否对称 /*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode *left;* T ...

leetcode 101 Symmetric Tree

解决：

leetcode 101 Symmetric Tree相关推荐

最新文章

热门文章