//递归方式 public int TreeDepth(TreeNode root) { if(root == null){ return 0; } TreeNode node = root; int left = TreeDepth(node.left); int right = TreeDepth(node.right); int res = left=left>right?left:right; return res+1; }
//递归方式 public int TreeDepth(TreeNode root) { if(root == null){ return 0; } TreeNode node = root; int left = TreeDepth(node.left); int right = TreeDepth(node.right); int res = left=left>right?left:right; return res+1; }
转载于:https://www.cnblogs.com/q-1993/p/10897931.html