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

Non-recursive methods should use flags #11

Open

ProfessorAtomicManiac opened this issue Oct 26, 2021 · 0 comments

Assignees

Labels

Owner

ProfessorAtomicManiac commented Oct 26, 2021

Some Iterative methods for binary tree traversal have visited nodes stored in a stack, which is bad for a number of reasons.

Getting an element from a stack takes O(n) time and should be replaced by a dynamic array where getting an element from an array takes O(1) time. Generally prefer Dynamic Arrays over Linked Lists
Another good replacement for a stack is to use flags where each object has a flag telling whether the object has been visited once already.

ProfessorAtomicManiac self-assigned this

ProfessorAtomicManiac added the enhancement label

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