Merge in BidirectionalIterator #1
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…tail() both work fine.
…re are still some bugs...
… major design flaw. Going to try a different way...
…or...time to test
…Need to write an official test suite to confirm.
…ed documentation of all relevant methods and put iterator code in its own module.
The choice of "a" or "an" generally operates by sound. It just a convention to follow the first pronounced vowel-like sound, so "an NGO," "an FOB contract," etc. The convention works the other way: "a" for a consonant-like sound, e.g. "a U.S. senator," "a united front," "a unit of mass," etc. Other than that, excellent work. 👍 💯 🥇 |
MS-DDOS
pushed a commit
that referenced
this pull request
Mar 3, 2017
Finish Version 1 AVL Development
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
BidirectionalIterator for the ThreadedTree (or any other class that implements its interface) that adds the ability for a user to quickly and lazily step forward and backward through the tree without a stack or recursion. This is a O(n) operation although in practice it is Theta(1).