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

Update 二叉树的递归遍历.md

Browse Source 
Go 中函数应该为小写 与 leetcode 保持一致。
This commit is contained in:
wjjiang
2021-07-29 11:44:51 +08:00
committed by GitHub
parent ff3875d502
commit 39f313ff0c
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/二叉树的递归遍历.md
View File

@ -222,7 +222,7 @@ Go：
前序遍历: 前序遍历:
```go ```go
func PreorderTraversal(root *TreeNode) (res []int) { func preorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {
@ -240,7 +240,7 @@ func PreorderTraversal(root *TreeNode) (res []int) {
中序遍历: 中序遍历:
```go ```go
func InorderTraversal(root *TreeNode) (res []int) { func inorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {
@ -257,7 +257,7 @@ func InorderTraversal(root *TreeNode) (res []int) {
后序遍历: 后序遍历:
```go ```go
func PostorderTraversal(root *TreeNode) (res []int) { func postorderTraversal(root *TreeNode) (res []int) {
var traversal func(node *TreeNode) var traversal func(node *TreeNode)
traversal = func(node *TreeNode) { traversal = func(node *TreeNode) {
if node == nil { if node == nil {