Data Structures and Algorithms

Pre-order traversal visits the root node first, then recursively traverses the left subtree, then the right subtree. The 'pre' prefix means the root comes before (pre) its children.

AVL trees are self-balancing binary search trees where each node's balance factor (height of left subtree minus height of right subtree) must be -1, 0, or 1. This constraint ensures the tree remains balanced.

Linked lists are linear data structures where elements are arranged sequentially. Each node points to the next, forming a linear chain. Trees and graphs are non-linear as elements branch in multiple directions.

A linked list is a dynamic data structure that allocates memory as needed, unlike static arrays, allowing it to grow and avoid the fixed-size overflow problems inherent in traditional array-based implementations.

In queue implementation using arrays, FRONT=REAR indicates an empty queue. This is the initial state after initialization. When FRONT=REAR+1 (in circular queues), the queue is full.

Stack is not a static data structure.

Traversing is the correct answer.

This is the right answer.

In the worst case,  O(n2)In average case O(nlogn).

This is the limitation of binary search.

This is not a valid operation.

This is correct.

This is the right choice.

In computer science, merge sort (also commonly spelled merge sort) is an O(n log n) comparison-based sorting algorithm.

This is the right answer.