mirror of
https://git.adityakumar.xyz/dsa.git
synced 2024-11-22 01:52:53 +00:00
add titles
This commit is contained in:
parent
8ae181c2c0
commit
16054298c8
2 changed files with 2 additions and 2 deletions
|
@ -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
|
||||
|
|
|
@ -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
|
||||
|
|
Loading…
Reference in a new issue