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.
2567 Commits
196 Branches
4 Tags
441 MiB
 
 
 
 
 
Tag: Branch: Tree: e4b182f499
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'e4b182f499'
${ noResults }
developer-roadmap/content/roadmaps/103-computer-science/content/115-balanced-search-trees
Kamran Ahmed 51a543f013
Add content for tries and balanced search trees 		2 years ago
..
100-avl-trees.md Add content for tries and balanced search trees 2 years ago
101-red-black-trees.md Add content for tries and balanced search trees 2 years ago
102-the-2-3-search-trees.md Add content for tries and balanced search trees 2 years ago
103-the-2-3-4-trees.md Add content for tries and balanced search trees 2 years ago
104-n-ary-trees.md Add content for tries and balanced search trees 2 years ago
105-b-tree.md Add content for tries and balanced search trees 2 years ago
readme.md Add content for tries and balanced search trees 2 years ago

readme.md

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.

Free Content Self-balancing binary search tree - Wikipedia Balanced Search Trees Operations and Applications 11 min Balanced binary search tree rotations