IMDEEPMIND-15: Updated notes on Connection Pooling and Transactions

docs/data-structure-and-algorithms/introduction.md

@@ -3,33 +3,3 @@ sidebar_position: 1
 ---
 
 # Introduction
-
-These are my notes on Data Structure Algorithms
-
-## Content Table
-
-### Algorithms
-
-1. [Array and Hashing](/docs/data-structure-and-algorithms/algorithms/arrays-and-hasing.md)
-2. [Sorting](/docs/data-structure-and-algorithms/algorithms/sorting.md)
-3. [Two Pointers](/docs/data-structure-and-algorithms/algorithms/two-pointers.md)
-4. [Sliding Window](/docs/data-structure-and-algorithms/algorithms/sliding-window.md)
-5. [Stack](/docs/data-structure-and-algorithms/algorithms/stack.md)
-6. [Queue](/docs/data-structure-and-algorithms/algorithms/queue.md)
-7. [Tree](/docs/data-structure-and-algorithms/algorithms/tree/introduction.md)
-   1. [Introduction](/docs/data-structure-and-algorithms/algorithms/tree/introduction.md)
-   2. [Binary Tree](/docs/data-structure-and-algorithms/algorithms/tree/binary-tree.md)
-   3. [Strict Binary Tree](/docs/data-structure-and-algorithms/algorithms/tree/strict-binary-tree.md)
-   4. [Full vs Complete Binary Tree](/docs/data-structure-and-algorithms/algorithms/tree/full-vs-complete-binary-tree.md)
-   5. [Strict vs Complete Binary Tree](/docs/data-structure-and-algorithms/algorithms/tree/strict-vs-complete-binary-tree.md)
-   6. [N-ary Tree](/docs/data-structure-and-algorithms/algorithms/tree/n-ary-tree.md)
-   7. [Tree Representation](/docs/data-structure-and-algorithms/algorithms/tree/tree-representation.md)
-   8. [Tree Traversal](/docs/data-structure-and-algorithms/algorithms/tree/tree-traversal.md)
-   9. [Common Algorithms](/docs/data-structure-and-algorithms/algorithms/tree/common-algorithms.md)
-8. [Binary Search Tree](/docs/data-structure-and-algorithms/algorithms/bst/introduction.md)
-   1. [Introduction](/docs/data-structure-and-algorithms/algorithms/bst/introduction.md)
-   2. [Key Operations](/docs/data-structure-and-algorithms/algorithms/bst/key-operations.md)
-
-### Time and Space Complexity
-
-1. [Time Complexity](/docs/data-structure-and-algorithms/time-space-complexity/time-complexity.md)

docs/databases/database-engineering/introduction.md

@@ -4,6 +4,12 @@ sidebar_position: 1
 
 # Introduction
 
+:::tip[Status]
+
+This note is complete, reviewed, and considered stable.
+
+:::
+
 Database engineering is about setting up, configuring, and managing databases to make sure they work well and meet the needs of users. It involves tasks like choosing the right type of database, setting it up for performance and security, managing backups, and making sure the database is always available.
 
 Database engineering ensures that databases are reliable, fast, and secure for everyday use.