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

Maximum Depth of N-ary Tree #47

Open

ritik-gupta opened this issue Oct 9, 2020 · 1 comment

Assignees

Labels

Contributor

ritik-gupta commented Oct 9, 2020

Question Link
https://leetcode.com/problems/maximum-depth-of-n-ary-tree/

Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

dexterpuru assigned ritik-gupta and unassigned ritik-gupta

dexterpuru added the Hacktoberfest label

Owner

dexterpuru commented Oct 10, 2020

@ritik-gupta go ahead 👍

ritik-gupta mentioned this issue

maximum depth of n-ary tree #48

Open

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment