Can you please explain the second method of Right View of Binary Tree?

#1

I understood the method of breadth first search but not the Depth first search method.

#2

hello @adityakaunhai
basically by dfs we are first traversing the right most path and printing all the nodes in that path.and then traversing second right most path but this time printing only those node whose level is greater than then max_level we encounter so far. similarly with third right most path and so on.