The heap.png image in the readme (https://raw.githubusercontent.com/kdn251/interviews/master/images/heap.png) shows a tree that does indeed respect the heap order property. The problem is when you mention the time complexities. In order to have O(log(n)) insert / remove time you also need for your heap to be a complete binary tree. The heap in the picture is not a complete binary tree. I think it

We are not handling the both left and right pointers when we delete the node. Update will be as mentioned below

// node only has right child
else if (!node.left) {
node.value = node.right.value
node.right = node.right.right
node.left = node.right.left;
}
// node only has left child
else if (!node.right

ISSUE TYPE

• Typo
• Bug
• Feature

WHERE / WHAT

Hello everyone,

You can contribute to this repo by adding questions that an interviewee can ask, which can help him decide and understand a company better.

All PR are accepted.