Nothing special here. It’s just a blog post for summarising my algorithm learning course. Probably this was taught in the University but I don’t remember anything, I have no idea about its definition and applications until I take this course.
Heap-ordered Binary Tree
- Each node represents a key
- Parent’s key is not smaller than children’s keys