Skip to content
New issue

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

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

Already on GitHub? # to your account

LC-1161. Maximum Level Sum of a Binary Tree #240

Open
hamidgasmi opened this issue Jul 20, 2020 · 1 comment
Open

LC-1161. Maximum Level Sum of a Binary Tree #240

hamidgasmi opened this issue Jul 20, 2020 · 1 comment

Comments

@hamidgasmi
Copy link
Owner

The problem description is available here

@hamidgasmi
Copy link
Owner Author

Sentinel node is not needed to separate levels between each other since the BFS queue is in 2 separated arrays.

# for free to join this conversation on GitHub. Already have an account? # to comment
Projects
None yet
Development

No branches or pull requests

1 participant