# archana77archana/Heap

>  A binary heap is a data structure created using a binary tree with two additional constraints: – The shape property : the tree is a complete binary tree ; that is all the levels of the tree, excepts possibly the l ast one (deepest) are fully filled, and if the last level of th e tree is not complete, the nodes of that level are filled from left to right.

- **Canonical URL**: https://githubrepo.cloud/repo/archana77archana/Heap
- **GitHub Repository**: https://github.com/archana77archana/Heap
- **Maintainer / Creator**: https://github.com/archana77archana
- **Discovered On**: Sep 30, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*