Heap

Structure Property

Recall a full binary tree is a tree in which every node other than the leaves has two children.

A complete binary tree is one where the tree is “full” on all levels except possibly the last, and the last level has all its nodes to the left side.

Exercise Which of the following are a complete binary tree?

Solution

The two on the top are complete binary trees but the bottom two are not.

PriorityQueue ADT ✅Submission class ✅Sorting submissions ✅Prioritizing Submissions ✅Java's Comparator ✅PriorityQueue Interface ✅PriorityQueue: Implementation ⚡ ✅PriorityQueue: Tree Implementation ✅Heap: Structure Property ⚡ 👀Heap: Order Property ⚡Heap: Ranked Array RepresentationHeap: BestHeap: InsertHeap: RemoveHeap Operations: Exercise ⚡