Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23606 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / kamal.r
Searching a binary tree for a value that matches a key value
is FAST, especially for tightly packed trees (a tightly
packed tree contains about twice as many elements as the
previous level)
o Therefore at most log(2)n comparisons are required either
to find a match or determine that no match exists.
o For example, searching a tightly packed 1000-element
binary search tree requies at most 10 comparisons because 2
o a binary search tree with n elements has a minimum of
log(2)n levels
o in-order: 0. if parameter node is null then return; 1.
recursive traverse left subtrees entirely 2. display data 3.
recursive traverse right subtrees entirely
o pre-order: 0 if param node is null return 1. display data
2. recursive traverse left subtrees entirely 3. recursive
traverse right subtree entirely.
o post-order: 0 if param node is null then return; 1.
recursive traverse left subtrees entirely 2. recursive
traverse right subtree entirely 3. display data
o to keep it efficient you must make sure to keep tree
balanced. Best way is to ensure the inputted data is coming
in with random values...If they are sorted in
ascending/descending order the tree will definitely become
unbanlanced
Fibnacci search
The Fibonacci Sequence is defined such that the first two
numbers of
the sequence are 0 and 1. subesequent numbers are the sum of the
previous two. e.g.
0, 1, 1, 2, 3, 5, 8, 13 ......
| Is This Answer Correct ? | 18 Yes | 5 No |
Post New Answer View All Answers
What is an example of an array?
In tree construction which is the suitable efficient data structure?
Is list a data type?
What is the space complexity of quicksort?
Is arraylist heterogeneous?
What are the basic data structures?
What do you mean by tree edge?
Which interfaces are implemented by abstractsequentiallist?
How do you solve a selection sort?
If you do not initialize an array what will happen?
Is array size dynamic or fixed?
What is a bubble sort and how do you perform it?
Does treemap allow duplicate keys?
Which is faster arraylist or linked list?
What is a multiset table?
