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
- 77246 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shweta
for binary tree ans is 5, the general formula is (2^n)-n
for binary search tree no. of tree possible is 3.
as root data can be either 1, 2 or 3
| Is This Answer Correct ? | 39 Yes | 38 No |
Post New Answer View All Answers
What are the 3 types of measurement?
What's difference between stack and queue?
Which sort is best for linked list?
Define threaded binary tree.
What is the meaning of arraylist?
Why is quicksort not stable?
How do you clear a stack?
What type of memory allocation is referred for Linked lists?
Define a stack?
how to delete first node from singly linked list?
What is binary tree example?
What is linked hash set?
What is the use of prototype?
When ArrayIndexOutOfBoundsException occurs?
What is sequential mapping in data structure?
