Views in a Binary Tree
Is your feature request related to a problem? Please describe. Different views of a Binary Tree (left view, right view, top view & bottom view)
Describe the solution you'd like Left & Right views can be obtained using level over traversal of the binary tree. Top & Bottom views can be obtained using level order traversal and horizontal distance with respect to the root node.
Describe alternatives you've considered All the views can be generated using recursion or iteration. Preferring iterative solution to prevent recursion call overhead.
Additional context Not Applicable
@siriak @yanglbme please assign this to me. I have created a pull request implementing this.
Please use the tag "hacktoberfest-accepted".
Pull request #3428 (link)
Hi. I can give the most optimal solution to find the views ( **top view , bottom view , left view and right view **) in a binary tree. please assign this issue to me.
Hello Sir , Can you assign this issue to me . I will give you a better solution and minimum time complexity for this issue to find all types of view in binary tree.
i want to do it
Hello Sir, please assign this issue to me
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!