Programming and Data Structures - Binary Heaps and Binary Search Trees

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Programming and Data Structures > > Binary Heaps and Binary Search Trees

1. Heap allocation is required for languages

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

2. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

3. A character of the data that binary search uses but the linear search ignore, is

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

4. Which of the following need not to be a binary tree?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

5. Which of the following need not be a binary tree?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Binary Heaps and Binary Search Trees

Forgot your password?

I agree with the Terms.