Heap Tree | Min heap | Max heap | Sinhala

Heap Tree | Min heap | Max heap | Sinhala Heap is a specialized tree-based data structure that is essentially an almost complete tree that satisfies the heap property. Heap property of max heap: the value of the parent is always greater than or equal, to the value of its child nodes. Heap property of min heap: the value of the parent is always less than or equal, to the value of its child nodes. 🔥Support us:   / codeprolk   ▬▬▬▬▬▬ T I M E S T A M P S ⏰ ▬▬▬▬▬▬ 00:46 properties of heap tree 02:08 types of heap tree 04:10 insert operation 08:07 delete operation ▬▬▬▬▬▬ Want to learn more? 🚀 ▬▬▬▬▬▬ ► Machine Learning Tutorial -    • Machine Learning Tutorial | Sinhala   ► Deep Learning Tutorial -    • Deep Learning Tutorial | Sinhala   ► Python Tutorial -    • Python Programming Tutorial | Sinhala   ► Java Tutorial -    • Java Programming Tutorial | Sinhala   ► MATLAB Tutorial -    • MatLab Tutorial - Sinhala   ► Python Libraries(Numpy, Matplotlib, Pandas) -    • NumPy, MatplotLib, Pandas Tutorial | Sinha...   ► Database Management System -    • Database Management Systems | Sinhala   ► Data Structures & Algorithms -    • Data Structures and Algorithms | Sinhala   ▬▬▬▬▬▬ Connect with me 👋 ▬▬▬▬▬▬ ► WEBSITE - https://codeprolk.com ► FACEBOOK -   / codeprolkofficial   ► LINKEDIN -   / codepro-lk   ► TIKTOK -   / codeprolk   ► WHATSAPP - https://whatsapp.com/channel/0029Vahy... ► GITHUB - https://github.com/dineshpiyasamara Music: https://www.bensound.com #programming #sinhala #codeprolk