Home FAQ Feedback Login

Data Structures - Trees

  1. Home
  2. Computer Science MCQ
  3. Data Structures
  4. Trees
1:   Which of the following statements is false ?
A. Every tree is a bipartite graph
B. A tree contains a cycle
C. A tree with n nodes contains n-1 edges
D. A tree is a connected graph
 
Answer Report Discuss
 

Option: B

Explanation :

Click on Discuss to view users comments.

Write your comments here:
2:   Which of the following remarks about Tree- indexing are true?
A. It is an m-ary tree
B. Successful searches should terminate in leaf nodes
C. Unsuccessful searches may terminate in leaf nodes level of the tree structure
D. All of these
 
Answer Report Discuss
 

Option: D

Explanation :

Click on Discuss to view users comments.

Write your comments here:
3:   A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called
A. Full binary tree
B. Binary Search Tree
C. Threaded tree
D. Complete binary tree
 
Answer Report Discuss
 

Option: D

Explanation :

Click on Discuss to view users comments.

Write your comments here:
4:   A complete binary tree with the property that the value at each node is at least as large as the values at its children is called
A. binary search tree
B. Binary Tree
C. Completely balanced tree
D. Heap
 
Answer Report Discuss
 

Option: D

Explanation :

Click on Discuss to view users comments.

Write your comments here:
5:   A full binary tree with n leaves contains
A. n nodes
B. log2n nodes
C. 2n - 1 nodes
D. 2n+1 nodes
 
Answer Report Discuss
 

Option: C

Explanation :

Click on Discuss to view users comments.

Write your comments here:

Sample Online Test

 Computer System Architecture Test I/O Operations in C Operating System Unit Test 7 Unix Online Test 3 Sets & Relations Online Unit Test Trees

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement

 


Syllabus covered in this section is-

  • Abstract data types
  • Algorithms
  • Stacks, Queues
  • Linked Lists
  • 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.
  • You can download Data Structures MCQ pdf from this site.
  • You can get access to Data Structures Multiple Choice Questions Answers  EBook.

Various Search Terms used for this section are

  • Data Structures quiz questions with answers

  • Data Structures exam questions answers

  • Data Structures MCQ questions Answers

  • Data Structures MCQ

  • Data Structure MCQ Pdf Download

 

Copyright © 2012-2024 by Avatto.com ™, All rights Reserved