Repository navigation
feat: add RightSideViewOfBinaryTree algorithm with tests - #7734
Open
roshankumar447 wants to merge 3 commits into
Open
roshankumar447 wants to merge 3 commits into
roshankumar447 wants to merge 3 commits into
Conversation
roshankumar447
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
November 7, 2026 15:12
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #7734 +/- ##
============================================
+ Coverage 82.33% 82.35% +0.02%
- Complexity 8444 8454 +10
============================================
Files 843 844 +1
Lines 26154 26171 +17
Branches 5109 5115 +6
============================================
+ Hits 21534 21554 +20
Misses 3830 3830
+ Partials 790 787 -3 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Description\nAdds the Right Side View of Binary Tree algorithm.\n\nGiven the root of a binary tree, returns the values of the nodes visible from the right side (last node of each level in BFS traversal).\n\n## Related\n- LeetCode #199: Binary Tree Right Side View\n\n## Changes\n- Added
RightSideViewOfBinaryTree.javawith BFS-based implementation\n- AddedRightSideViewOfBinaryTreeTest.javawith 5 test cases