My 8s recursion c++ solve.


  • 0
    G
    class Solution {
    public:
        int maxDepth(TreeNode* root) {
            if (root == NULL) return 0;
    		else return 1 + max(maxDepth(root->left), maxDepth(root->right));
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.