Commit 442151d

ybian19azl397985856

authored and

committed

feat: 104.maximum-depth-of-binary-tree add Python3 implementation (azl397985856#79)

1 parent 6b01607 commit 442151dCopy full SHA for 442151d

File tree

+18

-1

lines changed

+18

-1

lines changed

Lines changed: 18 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -49,7 +49,7 @@ var maxDepth = function(root) {`
`49`	`49`	`- 树的基本操作- 遍历 - 层次遍历(BFS)`
`50`	`50`
`51`	`51`	`## 代码`
`52`		`-* 语言支持:JS,C++`
	`52`	`+* 语言支持:JS,C++,Python`
`53`	`53`
`54`	`54`	`JavaScript Code:`
`55`	`55`	```js
`@@ -130,6 +130,23 @@ public:`
`130`	`130`	`}`
`131`	`131`	`};`
`132`	`132`	```
	`133`	`+`
	`134`	`+Python Code:`
	`135`	+```python
	`136`	`+class Solution:`
	`137`	`+ def maxDepth(self, root: TreeNode) -> int:`
	`138`	`+ if not root: return 0`
	`139`	`+ q, depth = [root, None], 1`
	`140`	`+ while q:`
	`141`	`+ node = q.pop(0)`
	`142`	`+ if node:`
	`143`	`+ if node.left: q.append(node.left)`
	`144`	`+ if node.right: q.append(node.right)`
	`145`	`+ elif q:`
	`146`	`+ q.append(None)`
	`147`	`+ depth += 1`
	`148`	`+ return depth`
	`149`	+```
`133`	`150`	`## 相关题目`
`134`	`151`	`- [102.binary-tree-level-order-traversal](./102.binary-tree-level-order-traversal.md)`
`135`	`152`	`- [103.binary-tree-zigzag-level-order-traversal](./103.binary-tree-zigzag-level-order-traversal.md)`

Comments

(0)