LeetCode_Algorithms_104_Maximum_Depth_of_Binary_Tree_Impl3.cs

public int MaxDepth(TreeNode root)
{
    if (root == null)
        return 0;
    if (root.left == null && root.right == null)
        return 1;
    int maxDepthLeft = 0, maxDepthRight = 0;
    if (root.left != null)
        maxDepthLeft = 1 + MaxDepth(root.left);
    if (root.right != null)
        maxDepthRight = 1 + MaxDepth(root.right);
    if (maxDepthLeft > maxDepthRight)
        return maxDepthLeft;
    else
        return maxDepthRight;
}