5.3 Leftist Heaps Insert & Delete Operation | Leftist Trees | Advanced Data Structures

In this video, we will learn how to perform different operations in Leftist Heaps or Leftist Trees like insert operation, delete operation and find minimum, etc and also calculate time complexity for all operations. For a better understanding, please watch the previous video of this Advanced Data Structures playlist where I have explained Merge Operation in Leftist Heaps. Timstamps: 0:00 Introduction 1:00 Find minimum operation 1:35 Insertion in Leftist Heaps 10:15 Initialize a leftist heap 11:37 Deletion in Leftist Heap Tags: #LeftistTrees #LeftistHeap #insertoperation #deleteoperation #findmin #dsa #heap #datastructures #advanceddatastructures #advanceddsa #trees #timecomplexity #leftisttree #leftistheap #steps #binaryheap