Question
a.
Incomplete binary tree
b.
Complete binary
c.
Full binary tre
d.
None of these
Posted under GATE cse question paper Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following will have efficient space and time complexities?
Similar Questions
Discover Related MCQs
Q. The worst case height of AVL tree with n nodes is
View solution
Q. The worst case complexity for searching an element in a binary search tree is
View solution
Q. The following sequence are inserted into a binary search tree:
6 10 25 12 4 7 15 8 33
What is the type of traversal given by: 6 4 10 7 25 8 12 33 15
View solution
Q. The running time of building MAX – HEAP is
View solution
Q. Which of the following sorting algorithm has average sorting behaviour
View solution
Q. The implementation of priority queue is
View solution
Q. If there are n elements in the heap, what is the time complexity of inserting new element in the heal in worst case?
View solution
Q. If a binary search tree traversed in order then numbers of the nodes will printed in
View solution
Q. In binary search tree which traversal is used for getting ascending order values?
View solution
Q. Building of heap operation will
View solution
Q. Which of the following is generally used to implement an almost complete binary tree?
View solution
Q. Which of the following is not an application of binary search trees?
View solution
Q. Consider the following statements:
I. An algorithm is a no.of steps to be performed to solve a problem
II. An algorithm is a no.of steps as well as the implementation using any language to a given Problem
III. To a given problem there may be more than one algorithm
Which one of the following is true?
View solution
Q. Which one of the following is true?
I. aⁿ = O(n²) (small oh) a>0
II. an²=O(n²) (big oh) a>0
III. an² O(n²) (small oh) a>0
View solution
Q. If the array is sorted the complexity is
View solution
Q. If the array is in reverse sorted order, then time complexities will be
View solution
Q. What be the time complexity for any typical array order?
View solution
Q. Quick sort gives O(n log n) worst case performances if the pivot is selected as
View solution
Q. T (n) = (2n/3)+1 then T(n) is equal to
View solution
Q. A language developed to assist children in learning geometric shapes and computing aspects is
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
