5.1 Leftist Trees | Leftist Heaps| Advanced Data Structures| Complete Introduction & Properties

In this video, I will cover the following after giving a brief intro of Binary heap and it's drawback :
What is a leftist tree?
What is S value / rank / distance of a node and how to find S value of a node in a tree?
Properties of Leftist Tree
What is a leftist heap?
Properties of Leftist Heap
Timestamps:
0:00 Introduction
1:38 Binary Heap (in brief)
3:22 Drawback Of Binary Heap
8:23 Svalue or rank or distance of a node
13:54 What is a leftist tree?
19:25 Properties of leftist tree
22:28 What is a leftist heap?
Tags:
#LeftistTrees #LeftistHeap #svalue #properties #dsa #heap #data structures #advanceddatastructures #advanceddsa #trees #timecomplexity #mergeoperation