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
- 78111 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / baljinder
1oth answer is xactly correst ie,BST=5 & BT=30
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
How do I sort a hashmap key?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
Mention a few applications of linked lists?
When should structures be passed by values or by reference?
How do you increase the capacity of an arraylist?
Is a list an array?
Define linear probing?
What should be done in the base case for this recursive problem?
Which is better hashmap or hashtable?
Is array size dynamic or fixed?
What is unbounded queue?
Which is better arraylist or linkedlist?
what is the difference between dynamic as well as non - dynamic data structures.
Define a binary search tree?
