Commit 8d38b26

ybian19azl397985856

authored and

committed

feat: 226.invert-binary-tree add Python3 implementation (azl397985856#133)

1 parent 6f35ccf commit 8d38b26Copy full SHA for 8d38b26

File tree

+29

-1

lines changed

+29

-1

lines changed

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -39,8 +39,11 @@ Google: 90% of our engineers use the software you wrote (Homebrew), but you can`
`39`	`39`
`40`	`40`	`## 代码`
`41`	`41`
`42`		-```js
	`42`	`+* 语言支持:JS,Python`
	`43`	`+`
	`44`	`+Javascript Code:`
`43`	`45`
	`46`	+```js
`44`	`47`	`/*`
`45`	`48`	`* @lc app=leetcode id=226 lang=javascript`
`46`	`49`	`*`
`@@ -122,3 +125,28 @@ var invertTree = function(root) {`
`122`	`125`	`return root;`
`123`	`126`	`};`
`124`	`127`	```
	`128`	`+`
	`129`	`+Python Code:`
	`130`	`+`
	`131`	+```python
	`132`	`+# Definition for a binary tree node.`
	`133`	`+# class TreeNode:`
	`134`	`+# def __init__(self, x):`
	`135`	`+# self.val = x`
	`136`	`+# self.left = None`
	`137`	`+# self.right = None`
	`138`	`+`
	`139`	`+class Solution:`
	`140`	`+ def invertTree(self, root: TreeNode) -> TreeNode:`
	`141`	`+ if not root:`
	`142`	`+ return None`
	`143`	`+ stack = [root]`
	`144`	`+ while stack:`
	`145`	`+ node = stack.pop(0)`
	`146`	`+ node.left, node.right = node.right, node.left`
	`147`	`+ if node.left:`
	`148`	`+ stack.append(node.left)`
	`149`	`+ if node.right:`
	`150`	`+ stack.append(node.right)`
	`151`	`+ return root`
	`152`	+```

Comments

(0)