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
- 71212 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
What are the disadvantages of linear list?
How do you create a tree diagram?
What is ascending and descending order?
Calculate the address of a random element present in a 2d array, given base address as ba.
Write program for Quick sort ?
How do you sort an arraylist?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Check if duplicates exist in an array of N which has range 1 to N.
What is a dequeue?
Why we need cursor implementation of linked lists?
What happens in insertion sort?
What is time complexity of hashmap?
Explain binary representation?
What are the difference between malloc() and calloc()?
What are different types of sorting techniques?
