Explain binary searching, Fibinocci search.
- 5 Answers
- 22102 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
Mention the advantages of representing stacks using linked lists than arrays?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What is the need for extendible hashing?
Name two algorithms two find minimum spanning tree?
How would you implement two stacks using a single array?
What is the use of data structure in real life?
How do you use the sort function?
How does dynamic memory allocation help in managing data?
Which sorting algorithm is best for small data?
Which is faster treemap or hashmap?
Define degree of the node?
Why is null not allowed in concurrenthashmap?
How do you solve a selection sort?
How to copy an array into another array?
Is a hashset ordered?
