Files
hello-algo/en/codes/go/chapter_tree/binary_tree_dfs.go
Yudong Jin 14c314c08c Retranslate the complete English edition from Simplified Chinese (#2010)
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
2026-10-31 03:35:51 +08:00

45 lines
839 B
Go

// File: binary_tree_dfs.go
// Created Time: 2022-11-26
// Author: Reanon (793584285@qq.com)
package chapter_tree
import (
. "github.com/krahets/hello-algo/pkg"
)
var nums []any
/* Preorder traversal */
func preOrder(node *TreeNode) {
if node == nil {
return
}
// Visit order: root -> left subtree -> right subtree
nums = append(nums, node.Val)
preOrder(node.Left)
preOrder(node.Right)
}
/* Inorder traversal */
func inOrder(node *TreeNode) {
if node == nil {
return
}
// Visit order: left subtree -> root -> right subtree
inOrder(node.Left)
nums = append(nums, node.Val)
inOrder(node.Right)
}
/* Postorder traversal */
func postOrder(node *TreeNode) {
if node == nil {
return
}
// Visit order: left subtree -> right subtree -> root
postOrder(node.Left)
postOrder(node.Right)
nums = append(nums, node.Val)
}