题解 | #牛群排列的最大深度#

import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param root TreeNode类
     * @return int整型
     */
    public static int max_depth = 0;
    public int maxDepth (TreeNode root) {
        search(root, 0);
        return max_depth;
    }
    public void search(TreeNode node, int cur) {
        if (node == null) {
            max_depth = Math.max(max_depth, cur);
            return;
        }
        search(node.right, cur + 1);
        search(node.left, cur + 1);
    
    }
}