aditya/dsa
1
0
Fork 0
mirror of https://git.adityakumar.xyz/dsa.git synced 2024-11-21 17:42:53 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add titles

Browse source
This commit is contained in:
Aditya 2024-06-03 10:50:31 +05:30
parent 8ae181c2c0
commit 16054298c8
Signed by: aditya
SSH key fingerprint: SHA256:jL1IvWsjjlPtw6HvDIHfXfhO9IkIokNEyIfuFhSdoyU
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
content/docs/dsa/trees/_index.md
View file

@ -8,7 +8,7 @@ bookCollapseSection: true
# bookComments: false # bookComments: false
# bookSearchExclude: false # bookSearchExclude: false
--- ---
# Trees
A tree, is a hierarchical way of organizing 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 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 of the most fundamental and widely used abstract data types (ADT). The structure consists of nodes

2
content/docs/dsa/trees/bst.md
View file

@ -8,7 +8,7 @@ weight: 1
# bookComments: false # bookComments: false
# bookSearchExclude: false # bookSearchExclude: false
--- ---
# Binary Search Tree
A Binary Search Tree (BST) is a type of data structure that organizes nodes in a hierarchical 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 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 lies in the way it stores elements based on their values to maintain an ordered sequence that allows