www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
60

Data structures and Algorithms MCQ with Answers

60) Which of the following remarks about Tree- indexing are true

It is an m-ary tree

Successful searches should terminate in leaf nodes

Unsuccessful searches may terminate in leaf nodes level of the tree structure

All of these

Answer is:

All of these

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

61) 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

Full binary tree

Binary Search Tree

Threaded tree

Complete binary tree

Answer is:

Complete binary tree

62) 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

binary search tree

Binary Tree

Completely balanced tree

Heap

Answer is:

Heap

63) A full binary tree with n leaves contains

n nodes

log₂n nodes

2n - 1 nodes

2n+1 nodes

Answer is:

2n - 1 nodes

64) A full binary tree with n non-leaf nodes contains

log n nodes

n + 1 nodes

2n-1 nodes

2n + 1 nodes

Answer is:

2n + 1 nodes

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here