How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?

Answer Posted / gautham

The Catalan Numbers should give an answer.. The answer is
C(3)= 5.

Is This Answer Correct ?    47 Yes 21 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the difference between hashset and hashmap?

523


What do you mean by linear probing?

583


Tell me the difference between structure and array?

461


What is the difference between list, set and map?

506


What are arrays used for?

532






Is data structure a data type?

499


Is quicksort a stable sorting algorithm?

523


What is linked list ?

525


What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?

525


Who invented data structure?

631


Explain the applications of stack?

538


Is arraylist heterogeneous?

488


What is data structure definition?

485


Tell me why might quick sort might be better than merge sort?

495


What are examples of data structures?

502