Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 77915 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / gautham
The Catalan Numbers should give an answer.. The answer is
C(3)= 5.
| Is This Answer Correct ? | 48 Yes | 21 No |
Post New Answer View All Answers
Is learning data structures necessary?
What is a directed graph?
Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.
How do you find the height of a binary tree?
Which is faster treemap or hashmap?
What are different techniques for making hash function? Explain with example.
How do I push an element into a stack?
What is 2 dimensional linked list?
What is an algorithm in coding?
How do you implement a stack?
How to find middle element of linked list in one pass?
How do you perform a merge sort?
Describe the complexity of Quick Sort
What are the scenarios in which an element can be inserted into the circular queue?
Can arraylist be null?
