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 »
Given a binary tree and a node, we aim to find the next node to the given node which is at the same level. Let us consider below example and analyse with input and outputs. Given binary tree with root at element 10. All elements 10, 4, 8, 50, 24, 5, 12. If given nodeRead More »
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 »
Queues are data structures on which operations are done in the first-in-first-out(FIFO) order. Unlike stacks, queues are open at both ends. For example lets take a simple queue of people who are standing to enter into an exhibition. There are two types of queues, those are Linear Queues and Circular Queues. Below is a linearRead More »