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.

Sign up for GitHub

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

Jump to bottom

Height of Binary tree #2

Closed
rishabh3112 opened this issue Jul 4, 2018 · 0 comments
Closed

Height of Binary tree #2

rishabh3112 opened this issue Jul 4, 2018 · 0 comments
Labels
problem Implement new Function for given question

Comments

@rishabh3112
Copy link
Owner

Question

Given a binary tree, find and return the height of given tree.
Input format

Nodes in the level order form (separated by space).
If any node does not have left or right child, take -1 in its place

Output format
Height
Constraints
1 <= N <= 10^5
@rishabh3112 rishabh3112 added the problem Implement new Function for given question label Jul 4, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
problem Implement new Function for given question
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@rishabh3112