Leetcode 104: Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

转载最新推荐文章于 2024-10-15 15:32:42 发布 · 62 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/liangmou/p/7838052.html

本文介绍了一种求解二叉树最大深度的算法。通过深度优先搜索(DFS)遍历树的节点，并记录从根节点到最远叶节点的最长路径上的节点数量，即为树的最大深度。

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.

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     public int val;
 5  *     public TreeNode left;
 6  *     public TreeNode right;
 7  *     public TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public int MaxDepth(TreeNode root) {
12         int[] max = new int[1] { 0 };
13         DFS(root, 1, max);
14         return max[0];
15     }
16     
17     private void DFS(TreeNode node, int cur, int[] max)
18     {
19         if (node == null) return;
20         
21         max[0] = Math.Max(cur, max[0]);
22         
23         DFS(node.left, cur + 1, max);
24         DFS(node.right, cur + 1, max);
25     }
26 }