Binary Trees and Graphs Quiz

Tree is a non-linear data structure.

• True

• False

The root is the predecessor of all nodes below it.

• True

• False

The immediate predecessor of a node in a tree is called the root.

• True

• False

A tree is a collection of nodes and this collection may be empty.

• True

• False

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

• the root of the tree.

• the first leaf node.

• the leftmost child node.

• the deepest leaf node.

A child node that has no parent is

• a rootless node

• an orphan node

• a leaf node

• none of the above

The ________ in a binary tree is analogous to the head pointer in a linked list.

• leaf pointer

• binary pointer

• null pointer

• root pointer

If a node has no successor, the corresponding pointer is set to

• the root of the tree.

• NULL.

• a leaf.

• point to its parent node.

The shape of a binary search tree is

• determined by the programmer.

• determined by the order in which values are inserted.

• always triangular.

• always balanced.

The preorder method of traversing a binary tree involves processing the root node's data, traversing the left subtree, and then traversing the right subtree.

• True

• False