right view of bt

[Dharmesh177]

Related Issue

• Mention issue for which this pull request is a part of (please mention issue number # )

Proposed Changes

• added code file for the right of binary tree
• changed readme file of tree traversal folder

Additional Info

• Any additional information or context

Checklist

• [x] ✅ My code follows the code style of this project.
• [x] 📝 My change requires a change to the README.
• [x] 🎀 I have updated the README accordingly.
• [x] 👀 I have read the CONTRIBUTING document.
• [x] ✨ I have added tests to cover my changes.
• [x] 🚩 All new and existing tests passed.
• [x] 🌟 ed the repo

• added code file for the right of binary tree
• changed readme file of tree traversal folder
• implemented this using cpp

-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.

https://github.com/Lakhankumawat/LearnCPP/issues/1524

The problem can be solved using simple recursive traversal. We can keep track of the level of a node by passing a parameter to all recursive calls. The idea is to keep track of the maximum level also. And traverse the tree in a manner that the right subtree is visited before the left subtree. Whenever we see a node whose level is more than the maximum level so far, we print the node because this is the last node in its level (Note that we traverse the right subtree before the left subtree)

-visual studio code platform is used

• [ ] Bug fix (non-breaking change which fixes an issue)
• [x] New feature (non-breaking change which adds functionality)
• [x] Breaking change (fix or feature that would cause existing functionality to change)

Output Screenshots

Screenshot #1	Screenshot #2
Output	Code
	I

|

[Dharmesh177]

review my PR @Lakhankumawat

[github-actions[bot]]

This PR is stale because it has been open 3 days with no activity. Please commit the changes requested or make improvements on the code. Thank you for your contributions!