How do you find the height of a binary tree?
Which data structure is applied when dealing with a recursive function?
Differentiate between list and map.
How does variable declaration affect memory allocation?
What is peep stack?
Where is insertion sort used?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
Write the disadvantages of separate chaining?
Which is faster hashmap or hashset?
What is binary tree give example?
What are the types of array operations?
Why arraylist is not efficient for manipulation?
how to add an item to the beginning of the list?