Exam 21: Binary Trees

Binary trees can be divided into

When working with a binary tree, a node that has more than two children

The InOrder, PreOrder, and PostOrder traversals can be accomplished using

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

Output will be the same if you use InOrder, PostOrder, or PreOrder traversals of the same binary tree.

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

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

In a binary tree, each node must have a minimum of two children.

A binary tree can be created using a struct or class containing a data value and

A subtree is an entire branch of a tree from one particular node down.

In a binary tree, each node may point to __________ other node(s).

Deleting a node that has two children offers an opportunity to use

All nodes to the right of a node hold values greater than that node's value.

When an application begins by searching a binary tree, it starts at

All node pointers that do not point to other nodes are set to

To remove a node that has children, you must first remove the children.

When a binary tree is used to facilitate a search, it is referred to as a

Select all that apply. Which of the following operations can be performed on a binary search tree?

A node that has no children is known as a