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
- 71375 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vipul
number of binary search tree= (2n)!/{n!*(n+1)!}
and number of binary tree=(2n)!/(n+1)!
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Which is best array or linked list?
Explain binary searching, Fibonacci search.
What are the tasks performed while traversing a binary tree?
List some applications of queue data structure.
What is dynamic array how is it created?
What method removes the value from the top of a stack?
Does arraylist allow null values?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
What are different sorting algorithms?
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
Write the disadvantages of separate chaining?
What is the difference between array and stack?
What data structure does a binary tree degenerate?
write an algorithm to show the procedure of insertion into a b-tree?
Can treeset contain null?
