🚀 JS | ✅ Binary Tree Inorder Traversal

✅ Javascript code implementation

var inorderTraversal = function(root) {
    const inorderTraversedArray = [];

    function nodeTraverse(node) {
        if (node.left) nodeTraverse(node.left);
        inorderTraversedArray.push(node.val);
        if (node.right) nodeTraverse(node.right);
    }
    if (root) nodeTraverse(root);

    return inorderTraversedArray;
};

📢Leetcode Solution

🚀 Runtime: 52 ms, faster than 52.85% of JavaScript online submissions for Binary Tree Inorder Traversal. 🚀 Memory Usage: 41.9 MB, less than 74.54% of JavaScript online submissions for Binary Tree Inorder Traversal.

📢 Follow on LinkedIn

📢 Follow on Leetcode