Is binary tree a binary search tree?
List the two important key points of depth first search?
Define a path in a tree?
What is a circular singly linked list?
Is array a data type?
Why quicksort is called quick?
What is the time complexity of selection sort?
Are sets sorted?
Can arraylist hold duplicates?
List out few of the Application of tree data-structure?
What does arraylist remove return?
Why we use linked list?
When is a binary search best applied?