leetcode-study/maximum-depth-of-binary-tree/Yiseull.java at main · DaleStudy/leetcode-study · GitHub

29 lines (26 loc) · 619 Bytes

/**

* Definition for a binary tree node.

* public 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;

* }

class Solution {

public int maxDepth(TreeNode root) {

return dfs(root);

}

private int dfs(TreeNode node) {

if (node == null) {

return 0;

}

return 1 + Math.max(dfs(node.left), dfs(node.right));

}

Expand file tree