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

[UPDATE ALGORITHM] Traversal of a Binary Tree without Recursion #1810

Closed
theonlybigmiao opened this issue Nov 9, 2024 · 1 comment
Closed

[UPDATE ALGORITHM] Traversal of a Binary Tree without Recursion #1810

theonlybigmiao opened this issue Nov 9, 2024 · 1 comment
Assignees
@theonlybigmiao
Labels
algorithm update gssoc-ext level1

Comments

@theonlybigmiao
Copy link
Contributor

Description:

We have implemented recursive preorder, inorder, and postorder traversals of a binary tree, and now I would like to supplement them with their non-recursive counterparts.

Checklist:

  • [√] Contributor in GSSoC-ext
  • [√] Want to work on it

Affected Algorithm:

Mention which algorithm you want to update and the specific directory where you want to change.

Additional Information:

Any extra details or suggestions related to the update.
@pankaj-bind
Copy link
Member

assigned

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

@theonlybigmiao theonlybigmiao

Labels
algorithm update gssoc-ext level1
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@pankaj-bind @theonlybigmiao