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
- 77015 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mann
binary seach tree will be one withh 2as root node
and 1 as left child and 3 as right child of root(2).
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
What is vector and types of vector?
What is a sorting algorithm in data structure?
What is stack in geography?
what is traversal in linked lists?
What is arrays copyof?
What is bitonic search?
Why do we Use a Multidimensional Array?
Can arraylist be null?
Why sorting algorithms are important?
What does the term sorting refer to?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
Differentiate between comparable and comparator.
How do you assign an address to an element of a pointer array ?
What is link list in data structure?
Different Types of pattern?
