algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: 0102.二叉树的层序遍历

Browse Source
This commit is contained in:
qiufeihong2018
2024-04-29 18:19:48 +08:00
parent 4ca945f998
commit 2d37cd39e0
1 changed files with 16 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
problems/0102.二叉树的层序遍历.md
View File

@ -2809,21 +2809,23 @@ func maxDepth(root *TreeNode) int {
* @param {TreeNode} root * @param {TreeNode} root
* @return {number} * @return {number}
*/ */
var maxDepth = function(root) { var maxDepth = function (root) {
// 最大的深度就是二叉树的层数 // 二叉树的 最大深度 是指从根节点到最远叶子节点的最长路径上的节点数。
if (root === null) return 0; let max = 0,
let queue = [root]; queue = [root];
let height = 0; if (root === null) {
return max;
}
while (queue.length) { while (queue.length) {
let n = queue.length; max++;
height++; let length = queue.length;
for (let i=0; i<n; i++) { while (length--) {
let node = queue.shift(); let node = queue.shift();
node.left && queue.push(node.left); node.left && queue.push(node.left);
node.right && queue.push(node.right); node.right && queue.push(node.right);
} }
} }
return height; return max;
}; };
``` ```