Add Right View of Binary Tree algorithm (DFS + BFS)

[Mahadevan2005]

Implemented the Right View of a Binary Tree using both DFS (Depth-First Search) and BFS (Level Order) approaches.

Time Complexity: O(n)

Space Complexity: O(h) for DFS, O(n) for BFS

Added JUnit tests for balanced, left-skewed, and right-skewed binary trees.

This contributes to the datastructures.trees package.

[codecov-commenter]

Codecov Report

❌ Patch coverage is 64.86486% with 13 lines in your changes missing coverage. Please review.
✅ Project coverage is 76.29%. Comparing base (b031a0b) to head (de85b81).

Files with missing lines	Patch %	Lines
...ms/datastructures/trees/RightViewOfBinaryTree.java	64.86%	10 Missing and 3 partials ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #6704      +/-   ##
============================================
- Coverage     76.29%   76.29%   -0.01%     
- Complexity     5918     5927       +9     
============================================
  Files           710      711       +1     
  Lines         20130    20167      +37     
  Branches       3902     3909       +7     
============================================
+ Hits          15359    15386      +27     
- Misses         4179     4188       +9     
- Partials        592      593       +1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.