二叉树右视图golang版本

二叉树右视图golang版本

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

func rightSideView(root *TreeNode) []int {
	ans := make([]int, 0)
	var dfs func(root *TreeNode, cnt int)
	dfs = func(root *TreeNode, cnt int) {
		if root == nil {

			return
		}
		if len(ans) <= cnt {
			ans = append(ans, root.Val)
		}
		dfs(root.Right, cnt+1)
		dfs(root.Left, cnt+1)
	}
	dfs(root, 0)
	return ans
}