Heap Tree

Question 1

What are the types of heaps?

Answer 1

max-heaps and min-heaps

Question 1

What are heaps mainly used for?

Answer 1

Heap sorts and priority queues

Question 2

What is a max-heap?

Answer 2

Max heaps are where the value of i is less than or equal to the value of their parent.

The parent is always bigger

Question 3

What is a min-heap?

Answer 3

Minheaps are where the value of i is greater than or equal to the value of their parent.

The parent is always smaller

Question 4

Height of a heap?

Answer 4

O(logn)

Question 5

Visualized as an array, where is the root?

Answer 5

At index 1

Question 6

Visualized as an array, where is the left child?

Answer 6

left(i) = 2*i

Question 7

Visualized as an array, where is the right child?

Answer 7

right(i) = 2 * i +1

Question 8

Visualized as an array, how to get to the parent?

Answer 8

parent(i) = floor(i/2)