From 16054298c8d5146a70a9aeb978f613600ae69749 Mon Sep 17 00:00:00 2001 From: Aditya Date: Mon, 3 Jun 2024 10:50:31 +0530 Subject: [PATCH] add titles --- content/docs/dsa/trees/_index.md | 2 +- content/docs/dsa/trees/bst.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) 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