{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Java Algorithms: Coding a Binary Tree Right Side View (LeetCode)","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/4eb2e173\"></iframe>","width":"100%","height":180,"duration":175,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/java-algorithms-coding-a-binary-tree-right-side-view-leetcode.\nIn this article, you will learn how to code a Binary Tree Right side view in LeetCode.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #javascript, #java, #leetcode, #computer-science, #data-structures, #algorithms, #competitive-coding, #programming, #hackernoon-es,  and more.\nThis story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,\n            and for more stories, please visit hackernoon.com.\nGiven 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.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}