Give a basic algorithm for searching a binary search tree?
Which is more efficient merge sort vs quicksort?
What is the difference between a push and a pop?
Give us a program to reverse a linked list.
What is 1d array?
Describe tree database.
What are the difference between malloc() and calloc()?
What happens if we put a key object in a hashmap which exists?
Is heap sort adaptive?
Differentiate linear from non linear data structure?
What is binary tree example?
What is a singletonlist?
Can we use ordered set for performing binary search?