To add "vertical traversal of the given binary tree" problem

[Amit-yadav099]

//this problem looks hard to code until understansd the basic conecpt behind it

Given a Binary Tree, find the vertical traversal of it starting from the leftmost level to the rightmost level. If there are multiple nodes passing through a vertical line, then they should be printed as they appear in level order traversal of the tree.

input : 1 / \ 2 3 / \ / \ 4 5 6 7 \ \ 8 9 Output: 4 2 1 5 6 3 8 7 9

if you think it is a good problem ,then assign this work to me ,please?

[mrigaankzoro]

Done

[shriya-27]

Hey @mrigaankzoro, I am interested in this issue, could you please assign this issue to me?

[Amit-yadav099]

@shriya-27 , this repository has been exclueded form hackoberfest2024. there is no sense to contribute here for hactoberfest2024