Today we will discuss another Binary Tree problem.
The Problem
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Example 1
1
2
Input: root = [1,2,3,null,5,null,4]
Output: [1,3,4]
Example 2
1
2
Input: root = [1,null,3]
Output: [1,3]
Example 3
1
2
Input: root = []
Output: []
The Solution
The solution to this problem can be derived from the Level Order Traversal problem we did on Binary Tree. The only difference between Level Order Traversal and this is instead of pushing all the elements in the current level to the final array, we will only push the last element at each level. This will be the right side view of the tree.
Let’s look at the code implementation of the above logic,
The run time complexity of this implementation will be O(n).
References