chore: cleanup orphaned content files (#9950)

Co-authored-by: jcanalesluna <56018501+jcanalesluna@users.noreply.github.com>

src/data/roadmaps/computer-science/content/cap-theorem@GZI8EsEqiMJX3fSbO_E-7.md

@@ -1,8 +0,0 @@
-# CAP Theorem
-
-The CAP theorem states that it is impossible for a distributed data store to simultaneously provide more than two out of Consistency, Availability and Partition Tolerance.
-
-Visit the following resources to learn more:
-
-- [@article@CAP Theorem](https://en.wikipedia.org/wiki/CAP_theorem)
-- [@video@What is CAP Theorem?](https://www.youtube.com/watch?v=_RbsFXWRZ10)

src/data/roadmaps/computer-science/content/trees@IaPd_zuLbiOCwoSHQLoIG.md

@@ -1,9 +0,0 @@
-# 2-3-4 Search Trees
-
-In practice: For every 2-4 tree, there are corresponding red–black trees with data elements in the same order. The insertion and deletion operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an important tool for understanding the logic behind red–black trees, and this is why many introductory algorithm texts introduce 2-4 trees just before red–black trees, even though 2-4 trees are not often used in practice.
-
-Visit the following resources to learn more:
-
-- [@article@CS 61B Lecture 26: Balanced Search Trees](https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q)
-- [@video@Bottom Up 234-Trees](https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
-- [@video@Top Down 234-Trees](https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5)