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.

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

Need the utility for DS traversal #14

Open
ZSShen opened this issue Jul 27, 2015 · 0 comments
Open

Need the utility for DS traversal #14

ZSShen opened this issue Jul 27, 2015 · 0 comments
Assignees
Labels

Comments

@ZSShen
Copy link
Owner

ZSShen commented Jul 27, 2015

Currently, we just get the DS size and rely on the single operator to iterate the entire DS.
But it will be inefficient if the operator cannot access the item in O(1) time.

This issue opens the window for performance optimization.
And the enhanced operators are listed below:

Vector:
next().

LinkedList:
next().

BinaryTree:
RedBlackTree:
inorder_successor().
inorder_predecessor().
preorder_successor().
preorder_predecessor().
postorder_successor().
postorder_predecesor().

@ZSShen ZSShen self-assigned this Jul 27, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant