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
- 77218 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
Define back edge?
What do you mean by back edge?
What member function places a new node at the end of the linked list?
Why concurrenthashmap is fail safe?
What is nsmutablearray?
Tell me about the different sorting techniques.
Why null is allowed in hashmap?
Define a full binary tree ?
Can you override methods of arraylist?
Can we use ordered set for performing binary search?
What is frozenset?
What is map keyset?
What is data structure explain different types of data structures with examples?
How can you represent a linked list node?
What's the difference between a hashtable and a hashmap?
