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

Queue Implementation using a singly linked list #820

Closed
wants to merge 10 commits into from
1 change: 1 addition & 0 deletions DIRECTORY.md
Original file line number Diff line number Diff line change
Expand Up @@ -79,6 +79,7 @@
* [Trie](https://github.com/TheAlgorithms/Rust/blob/master/src/data_structures/trie.rs)
* [Union Find](https://github.com/TheAlgorithms/Rust/blob/master/src/data_structures/union_find.rs)
* [Veb Tree](https://github.com/TheAlgorithms/Rust/blob/master/src/data_structures/veb_tree.rs)
* [Linked List Queue]([https://github.com/TheAlgorithms/Rust/blob/master/src/data_structures/linked_list.rs](https://github.com/Ismael144/Rust-algorithms/blob/master/src/data_structures/queue_using_singly_linked_list.rs))
* Dynamic Programming
* [Coin Change](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/coin_change.rs)
* [Egg Dropping](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/egg_dropping.rs)
Expand Down
2 changes: 2 additions & 0 deletions src/data_structures/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,7 @@ mod lazy_segment_tree;
mod linked_list;
mod probabilistic;
mod queue;
mod queue_using_singly_linked_list;
mod range_minimum_query;
mod rb_tree;
mod segment_tree;
Expand All @@ -34,6 +35,7 @@ pub use self::linked_list::LinkedList;
pub use self::probabilistic::bloom_filter;
pub use self::probabilistic::count_min_sketch;
pub use self::queue::Queue;
pub use self::queue_using_singly_linked_list::LinkedListQueue;
pub use self::range_minimum_query::RangeMinimumQuery;
pub use self::rb_tree::RBTree;
pub use self::segment_tree::SegmentTree;
Expand Down
Loading