Register

UGC NET CSE | December 2006 | Part 2 | Question: 22

• retagged by
2,373 views
0 votes
0 votes

Binary search tree is an example of :

  1. Divide and conquer technique

  2. Greedy algorithm

  3. Back tracking

  4. Dynamic Programming

• retagged by
User Avatar

1 Answer

0 votes
0 votes
Binary search as the name suggest is a search technic of searching key value in a sorted arrangement by halving the entire sorted arrangement and comparing the found value with key value.If the key value is less than the found value, then left hand portion again to be halved and so on. Similarly if the key value is greater than the search value at first halving, then we have to again halv the right hand side of found value and so on.

in this we divide and find out the key value if exist.

so it is a divide and conquer algorithm.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
914 views
UGC NET CSE | December 2006 | Part 2 | Question: 21
Which algorithm has same average, worst case and best case time ? Binary search Maximum of n number Quick sort Fibonacci search
Which algorithm has same average, worst case and best case time ?Binary searchMaximum of n numberQuick sortFibonacci search
User Avatar
11 votes
11 votes
1 answer
2
makhdoom ghaya asked Nov 19, 2016
5,910 views
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
User Avatar
25 votes
25 votes
3 answers
3
go_editor asked Feb 12, 2015
7,091 views
GATE CSE 2015 Set 2 | Question: 36
Given below are some algorithms, and some algorithm design paradigms. ... $\text{1-iii, 2-ii, 3-i, 4-iv}$ $\text{1-iii, 2-ii, 3-i, 4-v}$
Given below are some algorithms, and some algorithm design paradigms.$$\begin{array}{ll|ll}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divide a...
User Avatar
26 votes
26 votes
7 answers
4
khushtak asked Feb 14, 2017
7,060 views
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
User Avatar
Link Copied!