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 / hash define
12 binary trees
3 binary search trees
| Is This Answer Correct ? | 10 Yes | 44 No |
Post New Answer View All Answers
Define adjacent nodes?
What does arrays tostring do?
How do we find duplicate elements in an array?
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.
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
Can we store null in arraylist?
How can we reverse a singly linked list?
Explain the expression trees?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
What is nsmutablearray?
Explain extended binary tree.
Is set sorted?
What is the complexity of selection sort?
What is difference between while and do while?
How would you use bsearch() function to search a name stored in array of pointers to string?