Why it is said that searching a node in a binary search tree is efficient than t

Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?

Question Posted / lokendra singh

0 Answers
965 Views
I also Faced
E-Mail Answers

No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

What do you mean by general trees?

Explain multiply linked list in short.

What is an algorithm in coding?

What is a multiset table?

What is heap tree in data structure?

List the area of applications where stack data structure can be used?

What is the meaning of arraylist?

What is tree and its properties?

Is arraylist better than array?

What do you mean by disjoint set adt?

How does a heap sort work?

Is arraylist a collection?

For more Data Structures Interview Questions Click Here

Categories

Windows (3805)
Linux (2255)
Unix (1343)
Solaris (894)
RTOS (43)
Bulnex (4)
Operating Systems General Concepts (1242)
Data Structures (2039)
IBM AIX (132)
MS-DOS (66)
Operating Systems AllOther (199)