Data Structure: Application of stack. What is recursion? What are the conditions for an empty and full queue? How to insert an element in a binary search tree? How a stack can be implemented using two queues? How binary search can be applied to a linked list? BFS vs DFS.

Question

Accepted Answer

Questions on data structures and algorithms including stack, queue, binary search tree, and BFS vs DFS.

Recursion is a function that calls itself. It is used in many algorithms such as quicksort and binary search.
An empty queue has front and rear pointers pointing to the same location. A full queue has no empty spaces to insert new elements.
To insert an element in a binary search tree, compare the value of the new element with the root node. If it is less, insert it in the left subtree, else insert it in the right subtree.
A stack can be implemented using two queues by using one queue for storing elements and the other for temporary storage during push and pop operations.
Binary search can be applied to a linked list by first finding the middle element and then comparing it with the search value. If it is less, search in the right half, else search in the left half.
BFS (breadth-first search) visits all the nodes at the same level before moving to the next level. DFS (depth-first search) visits all the nodes in a branch before backtracking to the previous node.

Data Structure: Application of stack. What is recursion? What are the conditions for an empty and full queue? How to insert an element in a binary search tree? How a stack can be implemented using two queues? How binary search can be applied to a linked list? BFS vs DFS.

Popular interview questions of Associate Professor