Bfs addition #283

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

Closed

gquey wants to merge 2 commits into codedecks-in:master from gquey:BFS_addition

gquey commented Feb 1, 2022

Pull Request Template

Description

Solves the maximum depth of binary tree problem using a breadth first traversal.

Put check marks:

Have you made changes in README file ?

[^] Added problem & solution under correct topic.
[^] Specified Space & Time complexity.
[^] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

[^ ] Test A
[ ^] Test B

Passed the accompanying leetcode tests.

Make sure all below guidelines are followed else PR will get Reject:

[^] My code follows the style guidelines of this project
[^] I have performed a self-review of my own code
[^] I have commented my code so that it is easy to understand
[^] I have made corresponding changes to the documentation
[^] My changes generate no new warnings
[^] Any dependent changes have been merged and published in downstream modules

gquey added 2 commits

January 31, 2022 19:43

Create Maximum-Depth-of-Binary-Tree.cpp

88e4688

comments and readme update

d505b36

comments included and details added to readme

welcome bot commented Feb 1, 2022

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!

gquey closed this by deleting the head repository

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