Data Structures and Algorithms

This non-linear data structure is having a hierarchical relationship among its elements called nodes.

This sort technique compares two adjoining values and exchange them if they are not in proper order.

Yes, this is the correct answer.

This data structure is used to implement stack in a computer.

This sorting algorithm is based on divide-and-conquer method. It divides the list into two subsets.

If Top = MAX-1, then it means that the stack is full of elements or stack overflow.

A tree which is having only left subtree is called as left skewed tree.

This property of list structure states that the maximum level attributed to any element is within the list or within any sublist in the list.

This list is used to insert a new node into a queue.

This form of traversing is the one in which the left subtree of a tree is traversed first, then the root node and finally the right subtree are traversed.

This type of linked list is the one where the null pointer in the last node is replaced with the address of the first node.

It is a technique for detecting errors in digital data, but not for making corrections when errors are detected.

A stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop. The relation between the push and pop operations is such that the stack is a Last-In-First-Out (LIFO) data structure. It is the best data for checking the balancing of parenthesis.

 Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is a sequential technique.

If we declare an array, we have all permissions to initialize the elements to some value. We can initialize any element with any value. So, option 5 is correct.