Leetcode: Maximum Depth of Binary Tree

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

原创最新推荐文章于 2024-10-15 15:32:42 发布 · 625 阅读

0 ·

CC 4.0 BY-SA版权

Easy 同时被 2 个专栏收录

60 篇文章

订阅专栏

Tree

28 篇文章

订阅专栏

本文介绍了一种用于确定二叉树最大深度的算法实现。通过递归方式遍历二叉树的所有节点，找到从根节点到最远叶子节点的最长路径长度。该算法适用于计算机科学中数据结构的学习和应用。

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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if(root == null)
			return 0;
		else
			return traversal(root, 1);
	}
	
	public int traversal(TreeNode root, int depth){
		if(root == null)
			return Math.max(0, depth);// actually no need to test depth < 0
		int left = depth; int right = depth;
		if(root.left != null)
			left = traversal(root.left, left + 1);
		if(root.right != null)
			right = traversal(root.right, right + 1);
		return Math.max(left, right);
	}
}

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if(root == null)
			return 0;
		int left = maxDepth(root.left) + 1;
		int right = maxDepth(root.right) + 1;
		return left > right ? left : right;
	}
}