Suppose T is a binary tree with 17 nodes. What is the minimum possible depth of T? 1 3 4 2 A binary tree of N nodes has _______. Log2 N levels N / 2 levels Log10 N levels N x 2 levels The difference between a binary tree and a binary search tree is that : in binary search tree nodes are inserted based on the values they contain none of these in binary tree nodes are inserted based on the values they contain a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node What is the best code for the following procedure: AddStudent(studentName):add a new student to an array of alphabetically ordered names . Hint: We must shift some students. size contains the number of students in the array AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= size-1 ; j >i ; j++) arr[j+1] = arr[j]; arr[i] = studentName; } AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= size-1 ; j >i ; j++) arr[j+1] = arr[j]; arr[i] = studentName; } AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= i; j < size i; j++) arr[j+1] = arr[j]; arr[i] = studentName; } AddStudent(studentName){ int i ; for( i=0; i< size-1; i++){ if(arr[i].compareTo( studentName)>0) break; for(int j= size-1; j>= i; j--) arr[j+1] = arr[j]; arr[i] = studentName; } Adding an element to an array list at index i requires: Shifting the elements from position i+1 to the end of the array list after adding the new element. Shifting the elements from position i+1 to the end of the array list before adding the new element. Shifting the elements from position i to the end of the array list after adding the new element. Shifting the elements from position i to the end of the array list before adding the new element Compiler uses which one of the following to evaluate a mathematical equation: Binary Search Tree Binary Tree Queue none of these
Suppose T is a binary tree with 17 nodes. What is the minimum possible depth of T?
1
3
4
2
A binary tree of N nodes has _______.
Log2 N levels
N / 2 levels
Log10 N levels
N x 2 levels
The difference between a binary tree and a binary search tree is that :
in binary search tree nodes are inserted based on the values they contain
none of these
in binary tree nodes are inserted based on the values they contain
a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node
What is the best code for the following procedure:
AddStudent(studentName):add a new student to an array of alphabetically ordered names . Hint: We must shift some students. size contains the number of students in the array
AddStudent(studentName){
int i ;
for( i=0; i< size-1; i++){
if(arr[i].compareTo( studentName)>0)
break;
for(int j= size-1 ; j >i ; j++)
arr[j+1] = arr[j];
arr[i] = studentName;
}
AddStudent(studentName){
int i ;
for( i=0; i< size-1; i++){
if(arr[i].compareTo( studentName)>0)
break;
for(int j= size-1 ; j >i ; j++)
arr[j+1] = arr[j];
arr[i] = studentName;
}
AddStudent(studentName){
int i ;
for( i=0; i< size-1; i++){
if(arr[i].compareTo( studentName)>0)
break;
for(int j= i; j < size i; j++)
arr[j+1] = arr[j];
arr[i] = studentName;
}
AddStudent(studentName){
int i ;
for( i=0; i< size-1; i++){
if(arr[i].compareTo( studentName)>0)
break;
for(int j= size-1; j>= i; j--)
arr[j+1] = arr[j];
arr[i] = studentName;
}
Adding an element to an array list at index i requires:
Shifting the elements from position i+1 to the end of the array list after adding the new element.
Shifting the elements from position i+1 to the end of the array list before adding the new element.
Shifting the elements from position i to the end of the array list after adding the new element.
Shifting the elements from position i to the end of the array list before adding the new element
Compiler uses which one of the following to evaluate a mathematical equation:
Binary Search Tree
Binary Tree
none of these
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
