Binary Trees Introduction | Different types with visual representation with examples | Easy

preview_player
Показать описание
A tree data structure is logical design to store data such that it can be queried easily. Binary tree is a simplified version of the generic tree where each node can have a maximum two child nodes. This helps to decide at every node and eliminate half the search space. Based on this idea we have several types of binary trees. This video explores all the types with examples and diagrams.

Chapters:
00:00 - Intro
01:07 - What is a Binary Tree?
04:14 - Full Binary Tree
06:14 - Perfect Binary Tree
07:53 - Degenerate Tree
08:47 - Skewed Trees
10:09 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#datastructures #programming #binarytrees
Рекомендации по теме
Комментарии
Автор

Seriously the best channel for dsa understanding hands down

bhadrinarayanan
Автор

I feel sad.You work so hard yet your channel is so underrated

mdanik
Автор

bro please make video on graph, please bhaya

jayprakashjaiswal
Автор

For the Perfect Binary Tree (PBT), wouldn't the definition be: "each node has exactly 2 nodes, and all LEAF nodes are the the same level"? In the example (t=7:25) on the left, nodes 1, 3, 4, 5, 6, and 7 are all CHILD nodes but at different levels, yet the tree is a PBT. However, in the example on the right, nodes 10, 11, 6, 7, 8, and 9 are all LEAF nodes, but at different levels, hence why the tree is not a PBT.

NB: Great channel, keep up the good work. Thanks!

leobeeson