Golang Leetcode 257. Binary Tree Paths.go

思路

二叉树常规遍历

code

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

func binaryTreePaths(root *TreeNode) []string {
	s := []string{}
	if root == nil {
		return s
	}
	helper(root, strconv.Itoa(root.Val), &s)
	return s
}

func helper(node *TreeNode, path string, s *[]string) {
	if node.Left == nil && node.Right == nil {
		*s = append(*s, path)
	}
	if node.Left != nil {
		helper(node.Left, path+"->"+strconv.Itoa(node.Left.Val), s)
	}
	if node.Right != nil {
		helper(node.Right, path+"->"+strconv.Itoa(node.Right.Val), s)
	}

}

更多内容请移步我的repo： https://github.com/anakin/golang-leetcode