mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2025-08-11 03:34:00 +02:00
Fix link labels (#6122)
* Fix link labels * Update src/data/roadmaps/rust/content/101-language-basics/103-data-structures/113-queue.md --------- Co-authored-by: dsh <daniel.s.holdsworth@gmail.com>
This commit is contained in:
committed by
GitHub
parent
b48f81d98d
commit
680b2241e8
@@ -4,4 +4,4 @@ The **Linked List** in Rust is a sequence of nodes where each node consists of a
|
|||||||
|
|
||||||
Learn more from the following links:
|
Learn more from the following links:
|
||||||
|
|
||||||
- [@article@LinkedList](https://doc.rust-lang.org/std/collections/struct.LinkedList.html)
|
- [@official@LinkedList in std::collections - Rust](https://doc.rust-lang.org/std/collections/struct.LinkedList.html)
|
||||||
|
@@ -4,4 +4,4 @@ A `Binary Heap` is a complete binary tree which is either Min Heap or Max Heap.
|
|||||||
|
|
||||||
Learn more from the following links:
|
Learn more from the following links:
|
||||||
|
|
||||||
- [@article@BinaryHeap](https://doc.rust-lang.org/std/collections/struct.BinaryHeap.html)
|
- [@official@BinaryHeap](https://doc.rust-lang.org/std/collections/struct.BinaryHeap.html)
|
||||||
|
@@ -4,4 +4,4 @@ The **Stack** is a fundamental data structure in Rust, which is based on the pri
|
|||||||
|
|
||||||
Learn more from the following links:
|
Learn more from the following links:
|
||||||
|
|
||||||
- [@article@Box, Stack and Heap](https://doc.rust-lang.org/rust-by-example/std/box.html)
|
- [@official@Box, Stack and Heap](https://doc.rust-lang.org/rust-by-example/std/box.html)
|
||||||
|
@@ -4,4 +4,4 @@ In Rust, a Queue is another important linear data structure which follows a part
|
|||||||
|
|
||||||
Learn more from the following links:
|
Learn more from the following links:
|
||||||
|
|
||||||
- [@article@Queues](https://docs.rs/queues/latest/queues/)
|
- [@official@Queues](https://docs.rs/queues/latest/queues/)
|
||||||
|
Reference in New Issue
Block a user