To find the shortest path from one vertex to another in an unweighted graph, you should use Dijkstra's algorithm as it is the most efficient solution.

• True

• False

In a binary tree, a node may have a degree greater than 2.

• True

• False

Traversal in a graph is visiting each node at least once.

• True

• False

In binary search tress, the key of all elements are unique.

• True

• False

AVL trees are variations of binary search trees.

• True

• False

Searching is more efficient in binary search trees than in AVL trees.

• True

• False

In a binary search tree, the left and right subtrees of a node are also binary search trees.

• True

• False

If a node is a terminal node, then its left child and right child pointer are filled with NULL.

• True

• False

The process where two rotations are required to balance a tree is called double rotation.

• True

• False

All trees are graphs, all graphs are not trees.

• True

• False