This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-coding-a-binary-tree-right-side-view-leetcode.
In this article, you will learn how to code a Binary Tree Right side view in LeetCode.
Check more stories related to programming at: https://hackernoon.com/c/programming.
You can also check exclusive content about #javascript, #java, #leetcode, #computer-science, #data-structures, #algorithms, #competitive-coding, #programming, #hackernoon-es, and more.


This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
and for more stories, please visit hackernoon.com.



Given the root of a binary tree, imagine yourself standing on the right side of it. Then, return the values of the nodes you can see ordered from top to bottom. I would say it’s a pretty popular question during coding interviews Using simple words — think of the level for a particular node in a binary tree as the depth of that node. This code gives us linear time and space complexity, and it performs pretty well.

Ver todos los episodios