diff --git a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/110-linked-list.md b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/110-linked-list.md
index f2f4a7262..3b57e1d82 100644
--- a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/110-linked-list.md
+++ b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/110-linked-list.md
@@ -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:
 
-- [@article@LinkedList](https://doc.rust-lang.org/std/collections/struct.LinkedList.html)
\ No newline at end of file
+- [@official@LinkedList in std::collections - Rust](https://doc.rust-lang.org/std/collections/struct.LinkedList.html)
diff --git a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/111-binary-heap.md b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/111-binary-heap.md
index cbf8cc4ad..27642f4cb 100644
--- a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/111-binary-heap.md
+++ b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/111-binary-heap.md
@@ -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:
 
-- [@article@BinaryHeap](https://doc.rust-lang.org/std/collections/struct.BinaryHeap.html)
\ No newline at end of file
+- [@official@BinaryHeap](https://doc.rust-lang.org/std/collections/struct.BinaryHeap.html)
diff --git a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/112-stack.md b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/112-stack.md
index 24428e916..5690a0776 100644
--- a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/112-stack.md
+++ b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/112-stack.md
@@ -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:
 
-- [@article@Box, Stack and Heap](https://doc.rust-lang.org/rust-by-example/std/box.html)
\ No newline at end of file
+- [@official@Box, Stack and Heap](https://doc.rust-lang.org/rust-by-example/std/box.html)
diff --git a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/113-queue.md b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/113-queue.md
index 8ad4eaec4..8516cfbd9 100644
--- a/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/113-queue.md
+++ b/src/data/roadmaps/rust/content/101-language-basics/103-data-structures/113-queue.md
@@ -4,4 +4,4 @@ In Rust, a Queue is another important linear data structure which follows a part
 
 Learn more from the following links:
 
-- [@article@Queues](https://docs.rs/queues/latest/queues/)
\ No newline at end of file
+- [@official@Queues](https://docs.rs/queues/latest/queues/)