πŸš€ 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