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
- 71287 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 is the difference between length () and size () of arraylist?
How do you sort in ascending order in arraylist?
What is structured data with example?
Define linked list data structure.
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What is a property class?
What are hash tables good for?
What is an example of an algorithm?
Check if duplicates exist in an array of N which has range 1 to N.
Which sorting algorithms are in place?
What do you mean by secondary clustering?
What is map keyset?
What do you mean by level of the tree?
Is array a collection?
What are the 3 types of measurement?
