DATA STRUCTURES

The number of edges from the node to the deepest leaf is called ___ of the tree.

• Height

• Depth

• Length

• Width

What is a full binary tree?

• Each node has exactly zero or two children

• Each node has exactly two children

• All the leaves are at the same level

• Each node has exactly one or two children

What is a complete binary tree?

•  Each node has exactly zero or two children

• A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

• A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

• A tree In which all nodes have degree 2

Which of the following is not an advantage of trees?

• Hierarchical structure

• Faster search

• Router algorithms

• Undo/Redo operations in a notepad

In a full binary tree if number of internal nodes is I, then number of leaves L are?

• L = 2*I

• L = I + 1

• L = I – 1

• L = 2*I – 1

Which of the following highly uses the concept of an array?

• Binary Search tree

• Caching

• Spatial locality

• Scheduling of Processes

Any node is the path from the root to the node is called

• Successor node

• Ancestor node

• Internal node

• None of the above

Which of the following options is not true about the Binary Search tree?

• The value of the left child should be less than the root node

• The value of the right child should be greater than the root node

• The left and right sub trees should also be a binary search tree

• None of the above

What is the maximum number of children that a node can have in a binary tree?

• 3

• 1

• 4

• 2

The maximum number of nodes in a binary tree of depth 5 is

• 31

• 16

• 32

• 15