二叉樹的深度

題目鏈接:https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

 

import java.util.*;
public class Solution {
    int height = 0;
    public int TreeDepth(TreeNode root) {
        
        if(root == null){
            return 0;
        }
        int left = TreeDepth(root.left);
        int right = TreeDepth(root.right);
        
        height = Math.max(left,right) + 1;
        
        return height;
    }
}