algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0104.二叉树的最大深度: 调整一段 js 代码格式

Browse Source
This commit is contained in:
Yuhao Ju
2022-11-30 15:36:25 +08:00
committed by GitHub
parent 1e873a1984
commit dc3517c1b0
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0104.二叉树的最大深度.md
View File

@ -59,7 +59,7 @@ int getdepth(treenode* node)
if (node == NULL) return 0;
```
3. 确定单层递归的逻辑：先求它的左子树的深度，再求的右子树的深度，最后取左右深度最大的数值 再+1 （加1是因为算上当前中间节点）就是目前节点为根节点的树的深度。
3. 确定单层递归的逻辑：先求它的左子树的深度，再求右子树的深度，最后取左右深度最大的数值 再+1 （加1是因为算上当前中间节点）就是目前节点为根节点的树的深度。
代码如下：