My software development journey
Radix sort is an integer sorting algorithm. As it’s name indicates, it sorts a list of numbers based on the digits of the numbers. It’s a linear time sorting algorithm which is different from the comparison based sorting algorithms like quick sort or heap sort. Counting sort is also a linear time sorting algorithm which…
Given a binary tree, how do we write a program to check if it is the mirror image of itself. This binary tree is also called a symmetric tree. A binary tree is called a symmetric tree if it’s left and right sub-trees are mirror images of each other. For example Let us…
Given a binary tree, how do we print the nodes in level order starting from the bottom. For example for the following tree, the output should be 2 3 1 1 / 2 3An obvious solution is to first find the maximum levels of the tree. we can print the nodes from maximum level…