Trees Compared and Visualized | BST vs AVL vs Red-Black vs Splay vs Heap | Geekific

Discord Community:   / discord  
GitHub Repository: https://github.com/geekific-official/

Binary Search Trees, AVL Trees, Red-Black Trees, Splay Trees and many other tree implementations were covered in the past few weeks within this series. And as promised, this video will be dedicated to compare these implementations, dive deeper in the how and when should we use each of them and most importantly visualize these trees to see how each tree will look like if all of them were given the same output.

Timestamps:
00:00 Introduction
00:40 Binary Search Trees
01:35 AVL vs Red-Black
03:37 Visualizing the BST, AVL and Red-Black
05:32 Splay Trees Visualized
06:27 Heaps Visualized
07:52 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:
Introduction to Trees, Basic Tree Terminology and Different Types of Trees:    • Introduction to Trees and Basic Tree ...  
Binary Search Trees (BST) Explained and Implemented in Java:    • Binary Search Trees (BST) Explained a...  
AVL Trees Explained and Implemented in Java:    • AVL Tree Explained and Implemented in...  
Red-Black Trees Explained and Implemented in Java:    • Red-Black Trees Explained and Impleme...  
Splay Trees Explained and Implemented in Java:    • Splay Trees Explained and Implemented...  
B-Trees Made Simple and B-Trees Operations:    • B-Trees Made Simple | Introduction to...  

#Geekific #DataStructures #TreesCompared #TreesVisualized