leetCode 104.Maximum Depth of Binary Tree(二叉樹最大深度) 解題思路和方法
阿新 • • 發佈:2019-02-18
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
思路:很基礎的一個題,DFS即可。程式碼如下:/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int maxDepth(TreeNode root) { //沒有根節點 if(root == null){ return 0; } int dep1 = maxDepth(root.left); int dep2 = maxDepth(root.right); return dep1 > dep2 ? dep1+1:dep2+1; } }