Beated 94.21% 😎😎 || Javascript || Simple Small Code 😇
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nvar preorderTraversal = function (root) {\n    let arr = []\n    const getVal = (root) => {\n        if(!root)\n        return         \n        arr.push(root.val)\n        getVal(root.left)\n        getVal(root.right)\n    }\n    getVal(root)\n    return arr\n};\n```
['Recursion', 'JavaScript']