Interested to Buy Any Domain ? << Click Here >> for more details...
How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
- 28 Answers
- 78106 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / bragaadeesh
Not a direct answer. But you can find in depth concepts
about binary and binary search tree in this page.
http://technicalypto.blogspot.com/search?
q=binary+search+tree
| Is This Answer Correct ? | 1 Yes | 6 No |
Post New Answer View All Answers
Is heap sort adaptive?
What are the applications of b-tree?
Write program for Quick sort ?
What is bubble sort?
Which data structure is used to perform recursion?
what are the applications that use Linked lists?
Define non-linear data structures?
Is collection a class or interface?
What are different techniques for making hash function?
How many types of data structures are used?
If I try to add enum constants to a treeset, what sorting order will it use?
What is a priority queue?
What sort does arrays sort use?
Explain the most efficient method to reverse a linked list?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
