Home / MCQ Bank / Computer
Computer Trees In Data Structures Difficulty: Medium

Which type of binary tree traversal is useful for creating a sorted list of elements?

Select the correct option to test your answer:

More Computer Questions

Which of the following equals the a x b ( a and b are two vectors)? What is returned by math.ceil(3.4)? What is the type of Audit_log_events system variable? What is the worst space complexity of bucket sort (k = number of buckets)? What will be the output for the following code? #include<stdio.h> void combination(int arr[],int n,int r,int index,int aux[],int i); void print(int arr[], int n, int r) { int aux[r]; combination(arr, n, r, 0, aux, 0); } void combination(int arr[], int n, int r, int index, int aux[], int i) { if (index == r) { for (int j=0; j<r; j++) printf("%d ",aux[j]); printf(", "); return; } if (i >= n) return; aux[index] = arr[i]; combination(arr, n, r, index+1, aux, i+1); combination(arr, n, r, index, aux, i+1); } int main() { int arr[] = {1, 2,2}; int r = 2; int n = sizeof(arr)/sizeof(arr[0]); print(arr, n, r); return 0; }