当前位置：网站首页>Lexicon - the maximum depth of a binary tree

Lexicon - the maximum depth of a binary tree

2022-08-05 02:33:00 【qq_52025208】

Title description: Given a binary tree, find its maximum depth.

The depth of a binary tree is the number of nodes on the longest path from the root node to the farthest leaf node.

class Solution {public int maxDepth(TreeNode root) {if(root == null) return 0;int leftHeight = maxDepth(root.left);int rightHeight = maxDepth(root.right);return leftHeight>rightHeight?leftHeight+1:rightHeight+span>1;}}

Note:

return maxDepth(root.left)>maxDepth(root.right)?maxDepth(root.left)+1:maxDepth(root.right)+1;

The time complexity of this way of writing is very large, because it recurses the left subtree and the right subtree twice.

原网站

版权声明
本文为[qq_52025208]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/217/202208050200253941.html

边栏推荐

猜你喜欢

随机推荐