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
- 77025 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
Explain the uses of b+ tree.
Define double linked list?
How can you insert a node to the beginning of a singly linked list?
Write a Program for Insert in a sorted list
What happens if we put a key object in a hashmap which exists?
Which data structure is applied when dealing with a recursive function?
How do you find a string is anagram or not?
What is a hash in programming?
Differentiate null and void?
What is hashing in cyber security?
Is list same as array?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
What is meant by arraylist?
Name few classes that implement collection interface?
What are the advantages of merge sort?
