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
- 71223 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shekhar
(2n C n) / (n+1) is the Number of BST if N is the number of
integer/value;
| Is This Answer Correct ? | 17 Yes | 8 No |
Post New Answer View All Answers
what is the difference between singly and doubly linked lists?
What is bitonic search?
Can treemap key null?
Define collision in hashing?
Why null is allowed in hashmap?
How can you represent a linked list node?
What is meant by linked list?
Is hashmap ordered?
What are dynamic data structures?
Design a datastructure to represent the movement of a knight on a chess board
Can a binary tree be empty?
Is hashset a collection?
Which sorting algorithms are in place?
Give a basic algorithm for searching a binary search tree?
What are the collision resolution methods?
