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

Adding function for actual level order traversal #699

Merged
merged 1 commit into from
Feb 16, 2019
Merged

Adding function for actual level order traversal #699

merged 1 commit into from
Feb 16, 2019

Conversation

crackCodeLogn
Copy link
Contributor

No description provided.

poyea
poyea requested changes Feb 15, 2019
View reviewed changes
Copy link
Member

@poyea poyea left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks. It seems that this is printing out the binary tree using level order traversal. If that's the case, it's perfect if you make it look more like a tree!😉

@poyea poyea added the on hold label Feb 15, 2019
@crackCodeLogn
Copy link
Contributor Author

:P Yeah, it's printing level order traversal in a tree form, but then going for an actual tree form would be overkill. Also, this kinda iteration can be used for two more things:
a. Finding the depth of the tree
b. Connecting nodes at same level

@poyea poyea merged commit 6f28333 into TheAlgorithms:master Feb 16, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@poyea poyea poyea approved these changes

Assignees
No one assigned
Labels
on hold
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@crackCodeLogn @poyea