MindTree DSA Quiz 1

Heap sort is stable because it has time complexity of O(nlogn)

-Bubble sort is one of the most basic sorting methods. The element's size is compared with the next and the elements are then exchanged.

• The sinking type is also known as bubble sort.


• If bubble sort is applied to an array of N integers then each element will be compared to the next one.

• In bubble sort, element A[x] can be compared to element A[x+1].

Merge sort divides the list in sub-list, sorts and then merges them together

The for loop traverses through the list and then inserts a new node as cur.setNext(node);

Because you must traverse the list to discover the tail node, the time complexity of adding a new node at the head of the list is O(n).

The BFS method is used to locate nodes in a tree-based data structure that satisfy specific requirements.

Before moving on to the node at the next depth level, it starts at the root of the tree and analyses each node there.

More memory, often a queue, is needed to keep track of the child nodes that were found but haven't been thoroughly explored.

Using a method known as breadth first traversal (BFS), a visiting node travels through all of its descendants before any of its own descendants.

Breadth-first search is an algorithm for examining a tree or an unordered graph data structure (BFS).

Here, we start with a node, go to all of its neighbours on the same level, and then go to its neighbours on the next level.

The tree can have max one node for that yield the same result for  pre-order and post-order traversals.

Insertion sort will refer to this type of sorting algorithm.

Algorithm

Preorder (tree)

1. Go to the source.


2. Call Preorder after traversing the left subtree (left-subtree)


3. Call Preorder after navigating to the correct subtree (right-subtree)

The first and the last node in the doubly linked list will point to Null