My software development journey
Given an array, how do we sort the elements by descending order of their frequency? Also if two elements appear for same number of times, one which appeared first in the input array should be placed first. For example, if A = [7, 6, 1, 7, 1, 3, 6, 6, 2] The output should be…
Given a full binary tree (all nodes except leaf nodes have left and right child) represented as shown below. If the root is labelled i, it’s left child is labelled 2*i and right child is labelled as 2*i+1. 1 / \ 2 3 / \ / \ 4 5 6 7 Given two nodes from…
Given a binary tree, how to convert it to it’s mirror image?For example consider the following binary tree and it’s mirror image. Here simply, the left and right sub trees of each node are inverted. So we have to simply invert the given binary tree. It is a simple implementation problem. Using recursion we can…
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…
Given a sorted array, how do we create binary search which height balanced. For example the array [1,2,3,4,5] must be transformed to the following binary tree 3 / 2 4 / 1 5 We can use the divide and conquer approach to solve this problem. To create a…
Given a binary tree, how do we check if it is balanced or not? We say that a binary tree is balanced if height difference of left and the right sub-trees is at most 1 at any node. Consider the following examples 1 1 1 1 / / …
Given a binary search tree, how do we find a kth smallest or kth largest element? For example, given the following binary search tree. Third largest element is 6 Second smallest element is 2 Fifth largest element is 5 and so on… Solution: We can solve this problem by modifying the the in-order traversal method…
Given a binary tree, how do we print the right view of it?For example, consider the simple binary tree below 1 / 2 3 The right view of this is 1, 3. Similarly consider one more example 1 / 2 5 / 3 4 Right view for this tree contains…
Given two linked lists, we have to merge them into a single list by alternatively taking one node from each list.We should do this by re-arranging the links and should not create duplicate nodes while merging. For example consider the two lists 1 -> 2 -> NULL3 -> 4 -> NULL The result should look…