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
- 77896 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
Why is hashmap not thread safe?
Is arraylist heterogeneous?
How treemap orders the elements if the key is a string?
Differentiate between singly and doubly linked lists?
Devise a program to sort an array using bubble sort.
How to search binary in a sorted array?
Reverse a linked list from the middle.
Explain the internal working of a hash map?
Is treemap sorted?
How to get a list of tables, views and columns in firebird database?
What is bubble sort algorithm in data structure sort and searching?
What is collection process?
How does max heap work?
Why do we use collections?
What is circular queue example?
