Support us on Patreon: [ Ссылка ]
Discord Community: [ Ссылка ]
GitHub Repository: [ Ссылка ]

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: [ Ссылка ]
- Binary Search Trees (BST) Explained and Implemented in Java: [ Ссылка ]
- AVL Trees Explained and Implemented in Java: [ Ссылка ]
- Red-Black Trees Explained and Implemented in Java: [ Ссылка ]
- Splay Trees Explained and Implemented in Java: [ Ссылка ]
- B-Trees Made Simple and B-Trees Operations: [ Ссылка ]

#Geekific #DataStructures #TreesCompared #TreesVisualized

свернуть