We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Difficulty: 简单
Related Topics: 树, 深度优先搜索, 广度优先搜索, 二叉树
给你一个二叉树的根节点 root , 检查它是否轴对称。
root
示例 1:
输入:root = [1,2,2,3,4,4,3] 输出:true
示例 2:
输入:root = [1,2,2,null,3,null,3] 输出:false
提示:
[1, 1000]
-100 <= Node.val <= 100
**进阶:**你可以运用递归和迭代两种方法解决这个问题吗?
Language: JavaScript
/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } */ /** * @param {TreeNode} root * @return {boolean} */ var isSymmetric = function(root) { if (!root) return true const check = (left, right) => { if (!left && !right) return true if (!left || !right) return false return left.val === right.val && check(left.left, right.right) && check(left.right, right.left) } return check(root.left, root.right) }
The text was updated successfully, but these errors were encountered:
No branches or pull requests
101. 对称二叉树
Description
Difficulty: 简单
Related Topics: 树, 深度优先搜索, 广度优先搜索, 二叉树
给你一个二叉树的根节点
root
, 检查它是否轴对称。示例 1:
示例 2:
提示:
[1, 1000]
内-100 <= Node.val <= 100
**进阶:**你可以运用递归和迭代两种方法解决这个问题吗?
Solution
Language: JavaScript
The text was updated successfully, but these errors were encountered: