Crate linked_lists_rs

This crate aims to provide implementations in Rust of several data structures using linked lists as their underlying data structure

This crate’s documentation provides some simple examples and extensively details the exposed API

Usage

This crate is on crates.io and can be used by adding linked_lists_rs to your dependencies in your project’s Cargo.toml.

[dependencies]
linked_lists_rs = "1"

Example

use linked_lists_rs::stack::Stack;

let mut stack = Stack::new();

stack.push(5);

assert_eq!(Some(&5), stack.peek());
assert_eq!(Some(5), stack.pop());
assert_eq!(None, stack.pop());

Modules

immutable_list

Immutable List implementation

queue

Queue implementation A [Queue] is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).

stack

Stack implementation A [Stack] is a linear data structure that follows the principle of Last In First Out (LIFO).