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
- 71211 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
Is boolean a data type?
What is ds tree?
How memory is reserved using a declaration statement ?
What is a weighted graph?
Why do we Use a Multidimensional Array?
How do you declare A pointer to array of three chars
Can you make an arraylist of arrays?
Differentiate between iterator and listiterator.
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Which data structures are used in bfs and dfs algorithm?
Treemap orders the elements on which field?
Differentiate linear from a nonlinear data structure?
What is array sort?
What are different types of sorting algorithms?
What is the difference between arraylist and linkedlist?
