hero_java的专栏

package main import ( tree "awesomeProject/interview/Tree" "fmt" ) func postorderTraversal(root *tree.Node) []int { if root == nil { return nil } result := make([]int, 0) stack := make([]*tree.Node, 0) var lastVisit *tree.Node //弹出过的节点，保证根节点必须.

package main import ( tree "awesomeProject/interview/Tree" "fmt" ) //非递归中序遍历(left->root->right) func inorderTraversal(root *tree.Node) []int { result := make([]int, 0) if root == nil { return result } stack := make([]*tree.Node, 0) //首先判断.

package tree type Node struct { Val int Left *Node Right *Node } func NewNode(val int) *Node { node := &Node{ Val: val, Left: nil, Right: nil, } return node } 前序遍历： package main import ( tree "awesomeProject/interview/Tree" ".