Exam 19: Binary Trees

Values are commonly stored in a binary search tree so that a node's ________ child holds data that is less than the ________ data, while the node's data is less than the data in the other child.

In certain types of binary trees, the number of leaves can be greater than the number of nodes.

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

In a binary search tree, all nodes to the right of a node hold values greater than the node's value.

Binary trees are commonly used to organize key values that index database records.

A subtree is the collection of some node, together with all its descendants.

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

The main difference between a binary tree and a linked list is that

Binary tree are called "trees" because they resemble an upside-down tree.

A binary tree node with no parent is called the

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

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.

The shape of a binary search tree is

Inorder, preorder, and postorder traversals can be accomplished using

In a binary search tree where all the stored values are different, the node holding the largest value cannot have two children.

A binary tree can be created using a structure containing a data value and

Visiting all nodes of a binary tree in some methodical fashion is known as

Every node in a binary tree can have pointers to

A child node that has no parent is

The smallest number of levels that a binary tree with three nodes can have is two.