Find Kth largest element in BST(Binary Search Tree)

Find Kth largest element in Binary Search Tree.

---

Lets understand the problem statement correctly, What is the Input and the expected output.

Find Kth smallest element in BST(Binary Search Tree)

Find Kth smallest element in Binary Search Tree.

---

Lets understand the problem statement correctly, What is the Input and the expected output.

Heap Sort Algorithm

Heap Sort.

---

Before looking into Heap Sort, let's understand what is Heap and how it helps in sorting.

What is Complete Binary Tree?

A Complete binary tree is a binary tree in which every node other than the leaves has two children. In complete binary tree at every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

Let's understand with simple words now,
If a Binary Tree is filled level by level, left to right (Left child followed by Right child.) then it is called complete binary tree.
If Right child is present without Left child then it is not complete.