How does recursive functions keep count when searching for maximum depth of binary tree javascript

Question

 var maxDepth = function(root) {
     const recursion = (n) => {
         if (!n) return 0;
        
         let left = recursion(n.left)
         let right = re