binary_tree_right_side_view

Author: hitzzc

README.md

@@ -157,6 +157,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [190. Reverse Bits](https://github.com/hitzzc/go-leetcode/tree/master/reverse_bits)
 #### [191. Number of 1 Bits](https://github.com/hitzzc/go-leetcode/tree/master/number_of_1bits)
 #### [198. House Robber](https://github.com/hitzzc/go-leetcode/tree/master/house_robber)
+#### [199. Binary Tree Right Side View](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_right_side_view)
 
 
 

binary_tree_right_side_view/binary_tree_right_side_view.go

@@ -0,0 +1,33 @@
+package binary_tree_right_side_view
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func rightSideView(root *TreeNode) []int {
+	if root == nil {
+		return []int{}
+	}
+	rets := []int{}
+	queue := []*TreeNode{root}
+	last := root
+	for len(queue) != 0 {
+		top := queue[0]
+		queue = queue[1:]
+		if top.Left != nil {
+			queue = append(queue, top.Left)
+		}
+		if top.Right != nil {
+			queue = append(queue, top.Right)
+		}
+		if top == last {
+			rets = append(rets, top.Val)
+			if len(queue) != 0 {
+				last = queue[len(queue)-1]
+			}
+		}
+	}
+	return rets
+}