singularity

singularity 🔎

94. Binary Tree Inorder Traversal

O(n)

Inorder = left-root-right

var inorderTraversal = function(root) {
    let tree = [];

    function dfs(node){
        if(!node) return;
        if(node.val === null) return;
        let left = dfs(node.left);
        if(node.val != null){
            tree.push(node.val);
        }
        let right = dfs(node.right);
    }

    dfs(root);
    return tree;
};