Tip 1 : Practice as much on Algorithm and data structures.
Tip 2 : Clear basics of Linux.
Tip 1 : Write Project descriptions.
Tip 2 : Mention Work experience descriptions.
MCQ from every topic : OS, Networking, DBMS, Aptitude and DS algo.
Questions were asked on Data Structures.



We first find the middle node of the list and make it the root of the tree to be constructed.



Let the head be the first node of the linked list to be sorted and headRef be the pointer to head. Note that we need a reference to head in MergeSort() as the below implementation changes next links to sort the linked lists (not data at the nodes), so the head node has to be changed if the data at the original head is not the smallest value in the linked list.
Asked question on previous company, life and salary.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?