What is the space complexity of bubble sort?
What are the scenarios in which an element can be inserted into the circular queue?
Does treeset allow null values?
Mention the advantages of representing stacks using linked lists than arrays?
Which is faster treemap or hashmap?
What sort of serious problems have you experienced, and how have you handled them?
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.
How do I push an element into a stack?
What is a Breadth First Search? Give a few of its applications.
What are the properties of an algorithm?
How to excel in data structures and algorithms?
Can a tree be empty?
Explain pre-order and in-order tree traversal.
What are some of the best practices relating to the java collection framework?
Treemap orders the elements on which field?