Check if given binary tree is complete

Given a binary tree, the aim is to check the given binary tree is a complete binary tree or not. A complete binary tree is a binary tree in which all levels except the last level nodes are full. A full node is the one that has both left and right nodes that are notRead More »


Level order tree traversal

Other than usual pre, post, and in-order binary tree traversals. There are other ways to traverse a binary tree. We will see level order traversals in this article. In the level order traversal, tree nodes process level by level. There are two ways to solve this level order traversal problem. Recursive Approach In this approach,Read More »