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
- 71299 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / poornakala
for binary search tree, no of trees, (2^n)-n... here 8-3=5
trees... u can draw n see...
for binary tree, no of trees n(2^n)-n here 3*5=15...
replace node in each bst with other two values and see....
| Is This Answer Correct ? | 72 Yes | 48 No |
Post New Answer View All Answers
Can a hashset contain duplicates?
What are binary search and fibonacci search?
Are hash tables ordered?
Why is hashing used?
Can treeset contain null?
What is the difference between hashset and treeset?
What is heap and its types?
What is a dequeue?
Define a set?
What is complete binary tree in data structure?
What is the difference between an array and vector?
Explain implementation of traversal of a binary tree.
What is homogeneous array?
Why is tuple immutable?
Why do we use insertion sort?
