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
- 78819 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
How to reverse a singly linked list?
Why using cookie to store session info is a better idea than just using session info in the request?
Is bubble sort faster than selection sort?
Differentiate null and void?
How does bogo sort work?
Which is the parent class of list
Is array faster than arraylist?
What is the difference between hashmap and treemap?
How long does it take to master data structures and algorithms?
Why do we use data structures?
What is stack explain with diagram?
What is data structure and why we need it?
What is a map programming?
What are different methods of collision resolution in hashing.
What are threaded binary trees?
