algorithm
Level Order Traversal in Binary Tree | Explained with Code and Example
Traversal is an algorithm for visiting each node in a different fashion. Earlier we have seen see pre-order, in-order and post-order BT traversal. Now we are interested in...
Program to Find the Height of the Binary Tree using Recursion
What is the Height of Binary Tree (BT)? The height of the Binary Tree is the number of edges from the root node to the deepest leaf node. The height of the tree is the...
Selection Sort in C with Explanation | Algorithm, Program and Time Complexity
There are many sorting algorithms to sort the elements in the array. Some of the simple and widely used algorithms are as follows. Bubble Sort Quick Sort Insertion...
3 Binary Tree Traversal Algorithm (Preorder, Inorder and Postorder)
The tree is an important data structure. It has a parent and children relationship at various levels. In this article, we are more focusing on tree traversing. You will also...