How insertion sort and selection sorts are different?
Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list.
Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the unsorted sub-list and replaces it with the current element in hand.
Write a C language function to find the in-order successor of the root of a binary tree.
What is tree traversal?
What is a minimum spanning tree ? Describe Huffman’s Algorithm.
What are the differences between AVL Tree & Binary Search Tree ?