Minheap

Jan 21, 2025 Engineering

Cartesian Tree: Min-Heap with BST Properties

A Cartesian tree is a binary tree derived from a sequence of numbers that simultaneously satisfies two properties: it maintains BST ordering based on array indices, and it enforces the min-heap…

Jan 16, 2025 Engineering

Binary Heap: Min-Heap and Max-Heap Implementation

A binary heap is a complete binary tree that satisfies the heap property. ‘Complete’ means every level is fully filled except possibly the last, which fills left to right. The heap property defines…