This repository has been archived by the owner on Oct 6, 2021. It is now read-only.
Vertical Traversal of Binary tree #108
Labels
Comments
@manan025 I would like to take up this problem in JAVA |
@ishika22 Java assigned |
@manan025 Please assign python to me . |
@prakharshukla48 - Python assigned |
Hey, please assign C++ to me |
@tm2k23 - assigned cpp |
3 tasks
@manan025 I would like to contribute in Kotlin |
@sumanthtatipamula - Kt -assigned |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
馃殌 Feature
We will be printing a binary tree in vertical order.
Input:
Output: 4,2,1,5,3,6
Explanation:
As we can see there are 5 vertical lines which can pass through the tree -
1st vertical line - 4
2nd vertical line - 2
3rd vertical line - 1,5
4th vertical line - 3
5th vertical line - 6
Have you read the Contribution Guidelines?
Yes
Assignees
(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @tm2k23
Go -
Java - @ishika22
Javascript -
Kotlin - @sumanthtatipamula
Python - @prakharshukla48
The text was updated successfully, but these errors were encountered: