介绍
前序遍历 :https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
中序链接 :https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
后序遍历 :https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
解题
调整顺序即为前序、中序、后序遍历的不同方式
traverse(p.Left)
result = append(result, p.Val)
traverse(p.Right)
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
var result []int
func traverse(p *TreeNode){
if p == nil {
return
}
traverse(p.Left)
result = append(result, p.Val)
traverse(p.Right)
}
func inorderTraversal(root *TreeNode) []int {
result = nil
traverse(root)
return result
}
介绍
前序遍历 :https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
中序链接 :https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
后序遍历 :https://leetcode-cn.com/problems/binary-tree-postorder-traversal/
解题
调整顺序即为前序、中序、后序遍历的不同方式