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
- 78108 Views
- Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro, I also Faced
- E-Mail Answers
Answer Posted / anonymous
30 binary trees 10 for each 1,2 and 3.
only 1 binary search tree as with 2 as root node 1 as right child and 3 as left child.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the difference between data types and data structures?
Which is the parent class of linkedhashset class?
What is the top of a stack?
What are hashmaps good for?
What is the use of threaded binary tree?
What is hashing in cyber security?
Write a program for reversing the Single Linked List?
What is difference between array and arraylist?
Explain stacks and queues in detail.
Which language is best for data structures and algorithms?
List the data structures which are used in hierarchical data model.
Does arraylist have index?
What is a hashers run?
Does arraylist maintain insertion order?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
