github
/
developer-roadmap
mirror of https://github.com/kamranahmedse/developer-roadmap.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Roadmap to becoming a developer in 2022
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
4837 Commits
217 Branches
4 Tags
433 MiB
 
 
 
 
 
Tag: Branch: Tree: 9f7d902e5c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '9f7d902e5c'
${ noResults }
developer-roadmap/src/data/roadmaps/computer-science/content/balanced-search-trees@7DF3U...

816 B
Raw Blame History

Balanced Search Trees

Balanced search trees are a type of data structure that allow for fast insertion, deletion, and lookup of data. They are a type of self-balancing binary search tree, which means that they are a binary tree that maintains the binary search tree property while also keeping the tree balanced. This means that the tree is always approximately balanced, which allows for fast insertion, deletion, and lookup of data.

Visit the following resources to learn more: