Maximum Depth of Binary Tree
Recursive Call
Given the root
of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

์๋ฃ๊ตฌ์กฐ : N/A
์๊ณ ๋ฆฌ์ฆ 1. ์ฌ๊ทํธ์ถ์ ํตํด ์๋ ธ๋๊น์ง ๋ด๋ ค๊ฐ๋ค. - Null์ ๋ง๋ ๋๊น์ง ์ฌ๊ทํธ์ถ๋ก ์ญ ๋ด๋ ค๊ฐ๋ค! 2. Null์ ๋ง๋๋ฉด ๋น๋ก์ ๊ฐ์ ๊ฐ์ง๊ฒ ๋๋ค! 0 ๋๋ 1. - left:0, right:0, Math.max(0,0)+1 = 1
์๊ณ ๋ฆฌ์ฆ์ Java๋ก
package graph;
import java.util.*;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class MaxDepthBT {//recursive call
public static void main(String[] args) {
TreeNode root = new TreeNode(3);
root.left = new TreeNode(1);
root.right = new TreeNode(4);
root.left.left = new TreeNode(5);
root.left.right = new TreeNode(8);
root.left.left.left = new TreeNode(7);
System.out.println(solve(root));
}
public static int solve(TreeNode root) {
if(root == null) return 0;
int left = solve(root.left);
int right = solve(root.right);
return Math.max(left, right)+1;
}
}
Last updated
Was this helpful?