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 / 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


Please Help Members By Posting Answers For Below Questions

Why do we use binary search?

461


What is a vector class?

460


What is a pseudocode example?

470


What are the five examples of data?

468


Is array a dynamic data structure?

480






Define a tree?

562


Explain the expression trees?

566


What is meant by int?

502


What is array indexing?

472


Why we use linked list?

459


Explain the term base case?

493


Where will be the free node available while inserting a new node in a linked list?

549


What are different techniques for making hash function? Explain with example.

517


What are the types of bulleted list?

425


If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?

541