描述
给你二叉树的根节点root,返回它节点值的前序遍历。
题解
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
| package main
type TreeNode struct { Val int Left *TreeNode Right *TreeNode }
func preorderTraversal(root *TreeNode) []int { orderVal := make([]int, 0) preOrder(&orderVal, root)
return orderVal }
func preOrder(res *[]int, root *TreeNode) { if root == nil { return } *res = append(*res, root.Val) preOrder(res, root.Left) preOrder(res, root.Right) }
|