Data Structure

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

• AVL tree

• Red-black tree

• Lemma tree

• None of the above

________is very useful in situation when data have to stored and then retrieved in reverse order.

• Stack

• Queue

• List

• Link list

In the __________traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

• Depth First

• Breadth First

• With First

• Depth Limited

There is an extra element at the head of the list called a ________

• Antinel

• Sentinel

• List header

• List head

A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.

• vertices, edges

• edges, vertices

• vertices, paths

• graph node, edges

The disadvantage in using a circular linked list is __________

• it is possible to get into infinite loop

• last node points to fist node.

• time consuming

• requires more memory space.

State true of false.

i) A node is a parent if it has successor nodes.

ii) A node is child node if out degree is one.

• True, True

• False, True

• True, False

• False, False

A tree sort is also known as__________ sort.

• quick

• heap

• shell

• selection

_____________is the method used by card sorter?

• Radix sort

• Insertion

• Heap

• Quick

______________the condition indicate the queue is empty.

• Front=Null

• Null=Front

• Front=Rear

• Rear=Null