algorithm

package

v0.0.0-...-82289f8 Latest Latest Go to latest Published: Jul 30, 2020 License: MIT Imports: 2 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/Allenxuxu/leetcode-in-go

Links

Open Source Insights

README ¶

二叉树的后序遍历 `hard`

给定一个二叉树，返回它的后序遍历。

示例:

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [3,2,1]

进阶: 递归算法很简单，你可以通过迭代算法完成吗？

Documentation ¶

Index ¶

func Tree2Inorder(root *TreeNode) []int
func Tree2Postorder(root *TreeNode) []int
func Tree2Preorder(root *TreeNode) []int
type TreeNode
- func (tn *TreeNode) Equal(a *TreeNode) bool

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func Tree2Inorder ¶

func Tree2Inorder(root *TreeNode) []int

Tree2Inorder 把二叉树转换成 inorder 的切片

func Tree2Postorder ¶

func Tree2Postorder(root *TreeNode) []int

Tree2Postorder 把二叉树转换成 postorder 的切片

func Tree2Preorder ¶

func Tree2Preorder(root *TreeNode) []int

Tree2Preorder 把二叉树转换成 preorder 的切片

Types ¶

type TreeNode ¶

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func GetTargetNode ¶

func GetTargetNode(root *TreeNode, target int) *TreeNode

GetTargetNode 返回 Val = target 的 TreeNode root 中一定有 node.Val = target

func InPost2Tree ¶

func InPost2Tree(in, post []int) *TreeNode

InPost2Tree 把 inorder 和 postorder 切片转换成二叉树

func PreIn2Tree ¶

func PreIn2Tree(pre, in []int) *TreeNode

PreIn2Tree 把 preorder 和 inorder 切片转换成二叉树

func (*TreeNode) Equal ¶

func (tn *TreeNode) Equal(a *TreeNode) bool

Equal return ture if tn == a

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL