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
- 78068 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vinoth kumar.r
Binary search trees care only about the inorder traversal of
the tree. And specifying inorder traversal of a tree doesnt
mean there is a unique representation of it.
5 Binary search trees are possible
| Is This Answer Correct ? | 13 Yes | 9 No |
Post New Answer View All Answers
Is hashmap an array?
What are the drawbacks of array implementation of queue?
Where is insertion sort used?
Why do we use stacks?
What is unhashable type list?
What is numeric array?
Is it necessary to sort a file before searching a particular item ?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
How to find middle element of linked list in one pass?
Explain about map and their types?
how to display Singly Linked List from First to Last?
Define path in a graph?
Explain Stack
What is meant by deque?
Is list an array?
