Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Vertical Order Traversal of a Binary Tree #316

Open
divas18 opened this issue Oct 16, 2022 · 2 comments
Open

Vertical Order Traversal of a Binary Tree #316

divas18 opened this issue Oct 16, 2022 · 2 comments
Assignees

Comments

@divas18
Copy link

divas18 commented Oct 16, 2022

hi,
During interview, Interviewer asked me Vertical Order Traversal of a Binary Tree Question.
At that time, I little bit stuck and completed.
So, I requested you please add this solution which comes under Tree Topic

`Given the root of a binary tree, calculate the vertical order traversal of the binary tree.

For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectively. The root of the tree is at (0, 0).

The vertical order traversal of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.

Return the vertical order traversal of the binary tree.`

@CODER-AsHuToSh
Copy link

I know the solution, Please assign me this issue.

@ankit0802
Copy link

Please assign this to me sir! I have solved over 350+ problems in leetcode.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants