Interested to Buy Any Domain ? << Click Here >> for more details...
What data structure would you mostly likely see in a non
recursive implementation of a recursive algorithm?
- 3 Answers
- 22699 Views
- CTS, I also Faced
- E-Mail Answers
Answer Posted / karan
stack. Tree Travelsal is a very good example.
| Is This Answer Correct ? | 17 Yes | 0 No |
Post New Answer View All Answers
Name few classes that implement collection interface?
Which sorting algorithm is best for large data?
Does hashmap preserve insertion order?
What is the difference between for and foreach loop?
What is a postfix expression?
Why is hashmap not thread safe?
How does insertion sort works?
Which sorting is best and why?
What do you mean by hash table?
what is the biggest advantage of linked lists?
Differentiate between push and pop?
How do you sort an array in decreasing order?
What are the different binary tree traversal techniques?
What is the maximum size of array?
What does quick sort do?
