diff --git a/content/docs/dsa/trees/_index.md b/content/docs/dsa/trees/_index.md
index 5d09f85..819cebe 100644
--- a/content/docs/dsa/trees/_index.md
+++ b/content/docs/dsa/trees/_index.md
@@ -8,7 +8,7 @@ bookCollapseSection: true
 # bookComments: false
 # bookSearchExclude: false
 ---
-
+# Trees
 A tree, is a hierarchical way of organizing
 elements (often referred to as nodes) where each element has zero or more child elements. It is one
 of the most fundamental and widely used abstract data types (ADT). The structure consists of nodes
diff --git a/content/docs/dsa/trees/bst.md b/content/docs/dsa/trees/bst.md
index a24e663..d87adc4 100644
--- a/content/docs/dsa/trees/bst.md
+++ b/content/docs/dsa/trees/bst.md
@@ -8,7 +8,7 @@ weight: 1
 # bookComments: false
 # bookSearchExclude: false
 ---
-
+# Binary Search Tree
 A Binary Search Tree (BST) is a type of data structure that organizes nodes in a hierarchical
 manner, where each node has at most two children: left and right. The key characteristic of a BST
 lies in the way it stores elements based on their values to maintain an ordered sequence that allows