
π JS | β Symmetric Tree
#ProblemSolving#binaryTree#JS#leetcodeβ Javascript code implementation
var isSymmetric = function (root) {
return root === null || checkSymmetric(root.left, root.right);
};
const checkSymmetric = (leftNode, rightNode) => {
if (!leftNode && !rightNode) return true;
if (!leftNode || !rightNode) return false;
return (leftNode.val === rightNode.val
&& checkSymmetric(leftNode.left, rightNode.right)
&& checkSymmetric(leftNode.right, rightNode.left)
)
}
π’Leetcode Solution
π_Runtime: 55 ms, faster than 78.36% of JavaScript online submissions for Symmetric Tree._
π_Memory Usage: 44.4 MB, less than 55.65% of JavaScript online submissions for Symmetric Tree._
π’ Follow on LinkedIn
π’ Follow on Leetcode