C# solution: DFS


  • 0
    B
    public class Solution 
    {
        public int MaxDepth(TreeNode root) 
        {
            if (root == null) return 0;
            return Math.Max(MaxDepth(root.left), MaxDepth(root.right)) + 1;
        }
    }
    

Log in to reply
 

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