2022-05-30 update: added "Binary Tree Right Side View"

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/BinaryTreeRightSideView.java

@@ -0,0 +1,42 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+
+import java.util.*;
+
+// https://leetcode.com/problems/binary-tree-right-side-view/
+public class BinaryTreeRightSideView {
+
+    private final TreeNode input;
+
+    public BinaryTreeRightSideView(TreeNode input) {
+        this.input = input;
+    }
+
+    public List<Integer> solution() {
+        if (input == null) {
+            return Collections.emptyList();
+        }
+        List<Integer> result = new ArrayList<>();
+        Deque<TreeNode> deque = new LinkedList<>();
+        deque.add(input);
+        while (!deque.isEmpty()) {
+            int size = deque.size();
+            while (size != 0) {
+                TreeNode node = deque.poll();
+                if (node.left != null) {
+                    deque.addLast(node.left);
+                }
+                if (node.right != null) {
+                    deque.addLast(node.right);
+                }
+                if (size == 1) {
+                    result.add(node.val);
+                }
+                size--;
+            }
+        }
+        return result;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/medium/BinaryTreeRightSideViewTest.java

@@ -0,0 +1,34 @@
+package com.smlnskgmail.jaman.leetcodejava.medium;
+
+import com.smlnskgmail.jaman.leetcodejava.support.TreeNode;
+import org.junit.Test;
+
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class BinaryTreeRightSideViewTest {
+
+    @Test
+    public void defaultTest() {
+        assertEquals(
+                List.of(1, 3, 4),
+                new BinaryTreeRightSideView(
+                        new TreeNode(
+                                1,
+                                new TreeNode(
+                                        2,
+                                        null,
+                                        new TreeNode(5)
+                                ),
+                                new TreeNode(
+                                        3,
+                                        null,
+                                        new TreeNode(4)
+                                )
+                        )
+                ).solution()
+        );
+    }
+
+}