# Data Structures - Binary Heaps & Binary Search trees

1:   The average search time of hashing, with linear probing will be less if the load factor
 A. is for less than one B. equals one C. is for greater than one D. none of these Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
2:   Heap allocation is required for languages
 A. That support recursion B. That support dynamic data structure C. That use dynamic scope rules D. All of above Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:
3:   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?
 A. Preorder B. Postorder C. Inorder D. None of these Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
4:   A character of the data that binary search uses but the linear search ignores, is
 A. Order of the list B. Length of the list C. Maximum value in the list D. Minimum value in list Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. hemalatha said: (3:33am on Wednesday 19th December 2012) bits Write your comments here:
5:

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

 A. Search tree B. Heap C. AVL-Tree D. B-Tree Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. manideep said: (4:41am on Thursday 23rd May 2013) any body ..explain this please Write your comments here:

## Suggest an improvement

Syllabus covered in this section is-

• Abstract data types
• Algorithms
• Stacks, Queues
• Trees, Binary search trees
• Binary heaps

This Section covers Data Structures Questions Answers using C language .
Who can benefit -

• Any student who is pursuing B.Sc. in Information Technology can also use this Data Structures mcq section.
• Data Structures MCQs can also be used by any student who is pursuing any undergraduate or postgraduate degree in Computer Science.
• Any candidate who has to appear for DOEACC A, B or C level Exam can also use Data Structures Questions Answers to gain credits in their exams.
• Candidates appearing for Kendriya Vidyalya Sangathan Entrance Exam can also use Data Structures Multiple Choice Questions Answers for the preparation of their exams.
• Data Structures Questions Answers can also be used by MCA students for the preparation of their exams.
• You can also get Data Structures mcq pdf if you purchase an e-book from site.

Various Search Terms used for this section are