Heap and binary search tree

The binary tree in itself is not very useful in competitive programming problems. But the binary tree is the basis for more important and frequently used data structures like binary search trees and heaps.

We will understand and see their implementation in their respective chapters.

---

Let’s start with heaps in the next chapter!