Binary Trees, Heaps, MST & Shortest Path Algorithms

Height of a Complete Binary Tree The height of a complete binary tree is always O(log n)because nodes are filled level by level. Complete Binary Tree (CBT) A Complete Binary Tree is a binary tree in which: All levels are completely filled except po...