题解 | #二叉树的最大深度#

import java.util.*;

public class Solution {
    public int maxDepth (TreeNode root) {
        if (root == null)
            return 0;
        int treecn = treecount(root);
        return treecn;
    }
    public int treecount(TreeNode root){
        int left = 1;
        int right = 1;
        TreeNode tn = root;
        if (root.left != null) {
            tn = root.left;
            int left1 = treecount(tn);
            left = left + left1;
        }
        if (root.right != null) {
            tn = root.right;
            int right1 = treecount(tn);
            right = right + right1;
        }
        return left >= right ? left : right;
    }

}