Commit 7af99f0

committed

Update binary_tree.md

1 parent 73ee7b8 commit 7af99f0Copy full SHA for 7af99f0

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -101,6 +101,19 @@ vector<int> preorderTraversal(TreeNode* root){`
`101`	`101`	`}`
`102`	`102`	```
`103`	`103`
	`104`	`+#### 中序递归`
	`105`	+```python
	`106`	`+class Solution:`
	`107`	`+ def inorderRecursion(self, root, res):`
	`108`	`+ if root is None: return`
	`109`	`+ self.inorderRecursion(root.left, res)`
	`110`	`+ res.append(root.val)`
	`111`	`+ self.inorderRecursion(root.right, res)`
	`112`	`+ def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:`
	`113`	`+ res = list()`
	`114`	`+ self.inorderRecursion(root, res)`
	`115`	`+ return res`
	`116`	+```
`104`	`117`	`#### 中序非递归`
`105`	`118`
`106`	`119`	```cpp
`@@ -130,6 +143,22 @@ vector<int> inorderTraversal(TreeNode* root){`
`130`	`143`	`}`
`131`	`144`	```
`132`	`145`
	`146`	`+`
	`147`	`+#### 后续递归`
	`148`	+```python
	`149`	`+class Solution:`
	`150`	`+ def postorderRecursion(self, root, res):`
	`151`	`+ if root is None: return`
	`152`	`+ self.postorderRecursion(root.left, res)`
	`153`	`+ self.postorderRecursion(root.right, res)`
	`154`	`+ res.append(root.val)`
	`155`	`+ def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:`
	`156`	`+ res = list()`
	`157`	`+ self.postorderRecursion(root, res)`
	`158`	`+ return res`
	`159`	`+`
	`160`	+```
	`161`	`+`
`133`	`162`	`#### 后序非递归`
`134`	`163`
`135`	`164`	```cpp

Comments

(0)