Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23856 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / bharath
finally a sensible answer.........
fibonacci search is based on fibonacci heaps.
it is advanced structure tugher to implement and even more
efficient than BSTs , latest kernels used it fr app handles...
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What are the tasks performed during preorder traversal?
What is the minimum number of nodes that a binary tree can have?
In what scenario, binary search can be used?
Define double linked list?
State the difference between arrays and linked lists?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
Define level of the tree?
What are splay trees?
Which sorting technique is faster?
What are the types of algorithms?
What is a matrix?
What is the advantage of the heap over a stack?
What exactly is a thread?
Why do we need linked list?
Is it possible to store null key and null values in a hashmap?
