// If we've traversed exactly k nodes, this is our result.
        if (count == k) 
            result = node.val; // why not returning right here? why do we need to go through the child nodes on the right subtree?

        // Finally, traverse the right subtree.
        traverse(node.right, k);