+91-9920808017
Take an Online Test - GK Test / Computer Organisation Test


Data Structures


Home >Computer Science MCQ >

Data Structures >

Trees


Data Structures

Abstract Data Types
Algorithms
Binary Heaps & Binary Search trees
Graphs
Hashing
Linked Lists
Queues
Sorting & Searching
Stacks


Artificial Intelligence

C Programming MCQ

Compiler Design

Computer Graphics

Computer Networks

Computer Organization Architecture

Data Mining

Data Warehousing MCQ

Database MCQ

Digital Logic

Mathematical Logic

Object Oriented Programming

Operating System

Software Engineering MCQ

Theory Of Computation MCQ

Unix

Web Technology

Windows Programming MCQ


 

 

Online Test





11: A binary tree having n nodes and depth d will be about complete binary tree if

A.
any node nd at level less than d-1 has two sons
B.
it contains log(d)+1 nodes
C.
for any node nd in the tree with a right descendent at level d lt must have a left son
D.
all of these
  Answer Report Discuss

12: Which of the following statements are correct ?
I. If each tree node contains a father field, then it's not necessary to use either stack or threads
II. Traversal using father pointers is more time efficient than traversal of a threaded tree
III. A in-threaded binary tree is defined as binary tree that is both left-in threaded and right-in
threaded.



A.
II and III
B.
I and III
C.
I and II
D.
None of these
  Answer Report Discuss

13: A binary tree of depth "d" is an almost complete binary tree if

A.
each leaf in the tree is either at level
B.
for any node
C.
both a and b
D.
None of these
  Answer Report Discuss

14: If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called
A.
Complete tree
B.
Full binary tree
C.
Binary search tree
D.
AVL tree
  Answer Report Discuss

15: The number of nodes in a complete binary tree of level 5 is

A.
15
B.
20
C.
63
D.
71
  Answer Report Discuss

  1 2 3 4 5 6 7 8


Computer Science
Engineering Maths
Free Online Test