Skip to content

Need the utility for DS traversal #14

Open
@ZSShen

Description

@ZSShen

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().

Metadata

Metadata

Assignees

Labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions