Exam 21: Binary Trees

When you dereference a pointer to a pointer, the result is

The shape of a binary tree is

Select all that apply. Binary trees may be implemented as templates, but any data types used with them must support the __________ operator.

In a non-linear linked list, a node can point to

Deleting a leaf node from a binary tree is not difficult but deleting a non-leaf node requires several steps.

A binary tree with a height of three has

When the root node points to two other nodes, the nodes are referred to as

The width of a tree is the largest number of nodes in the same level.

The binary tree structure is called a "tree" because it resembles an upside-down tree.

The height of a tree describes how many levels there are in the tree.

Select all that apply. The head pointer, anchored at the top of a binary tree, may be called the

Select all that apply. Which of the following are methods of traversing a binary tree?

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

The intBinaryTree class has a public member function, findNode, that returns true if a value is not found and False if the value is found.

A good reason to use the binary tree structure is

Values are typically stored in a binary search tree so that a node's __________ child holds data that is less than the __________ data.

The __________ in a binary tree is similar to the head pointer in a linked list.

In a binary tree class you usually have a pointer as a member that is set to the

The process of stepping through the nodes of a binary tree is known as

The first node in a binary tree list is called the