computer-scienceangular-roadmapbackend-roadmapblockchain-roadmapdba-roadmapdeveloper-roadmapdevops-roadmapfrontend-roadmapgo-roadmaphactoberfestjava-roadmapjavascript-roadmapnodejs-roadmappython-roadmapqa-roadmapreact-roadmaproadmapstudy-planvue-roadmapweb3-roadmap
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.
10 lines
894 B
10 lines
894 B
# 2-3 Search Trees |
|
|
|
In practice: 2-3 trees have faster inserts at the expense of slower searches (since height is more compared to AVL trees). |
|
|
|
You would use 2-3 tree very rarely because its implementation involves different types of nodes. Instead, people use Red Black trees. |
|
|
|
<ResourceGroupTitle>Free Content</ResourceGroupTitle> |
|
<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2'>23-Tree Intuition and Definition</BadgeLink> |
|
<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6'>Binary View of 23-Tree</BadgeLink> |
|
<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp'>2-3 Trees (student recitation)</BadgeLink>
|
|
|