Trees can also be traversed in level-order. In level order traversal we visit every node of the level before going to the next level. C Program for level Order traversal of Binary tree using recursion is also given below.
Shortest Job First (SJF) is process scheduling algorithm that selects the waiting process with the smallest execution time to execute first. SJN is a non-preemptive algorithm. This algorithm is also known as Shortest Job Next.
In this type of scheduling algorithm each process has a priority associated with it and when each process hits the queue it is stored at position based on its priority. The process with the higher priority will be dealt first.
In this question, a number which is represented by Linked List is given to you. You have to increment the number by 1 and the number must remain in the form of Linked List.
Selection sort is a sorting algorithm, specifically an in-place comparison sort. It sorts an array by finding the minimum element in every iteration. This algorithm finds the lowest element in the array and place it at first position in first iteration, second lowest element in second iteration and so on.
Insertion sort, This algorithm repeatedly adds new element to the sorted result. In this algorithm we take first element as the sorted sub-array. Then we take second element and puts it into the first sorted sub-array at its correct position (i.e we do shifting if necessary).
Doubly Linked List is a variation of Linked List in which traversal is possible in both directions, forward and backward. Doubly Linked List have two fields one is data field and other is link fields. Link fields itself contain two pointers, next and prev.