199 binary tree right side view

199. 二叉树的右视图

go：

/**

 * Definition for a binary tree node.

 * type TreeNode struct {

 *     Val int

 *     Left *TreeNode

 *     Right *TreeNode

 * }
 */
func rightSideView(root *TreeNode) []int {
    if root == nil {
        return nil
    }

    var results []int
    queue := []*TreeNode{root}

    for len(queue) > 0 {
        levelSize := len(queue)
        
        for i := 0; i < levelSize; i++ {
            node := queue[0]
            queue = queue[1 :]

            if node.Left != nil {
                queue = append(queue, node.Left)
            }

            if node.Right != nil {
                queue = append(queue, node.Right)
            }

            if i == levelSize - 1 {
                results = append(results, node.Val)
            }
        }
    }

    return results
}