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
- 78820 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / kanha
for binary tree answer is n! ways that is 3!=6
For Binary search tree n ways..that is 3
| Is This Answer Correct ? | 17 Yes | 52 No |
Post New Answer View All Answers
What is worst case complexity algorithm?
What is array traversing?
Explain the sorting algorithm that is most suitable to be used with single linked list?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
How dynamic arrays are created?
What is a multidimensional array?
Why is quicksort not stable?
Sorting is not possible by using which of the methods?
Mention the advantages of representing stacks using linked lists than arrays?
How do you clear a stack?
Is quicksort faster than merge sort?
What do you mean by hash function?
What are the major data structures used in the following areas : network data model & hierarchical data model?
How do you create a tree diagram?
What are the advantages of linked list over array (static data structure)?
