Chapter 21 Quiz
when working with a binary tree, a node that has more than two children
is theoretically impossible in a correctly developed binary tree structure
values are typically stored in a binary search tree so that a node's ________ child holds data that is less than the ________ data
left, node's
in a non-linear linked list, a node can point to
more than one other node, plus the previous node in sequence
all node pointers that do not point to other nodes are set to
a null pointer
Deleting a node that has two children offers an opportunity to use
all of these
when you dereference a pointer to a pointer, the result is
another pointer
in a binary tree, each node may point to ________ other node(s)
any of these (no, one, two)
when a binary tree is used to facilitate a search, it is referred to as a
binary search tree
when the root node points to two other nodes, the nodes are referred to as
child nodes, or children
the shape of a binary tree is
determined by the order in which values are inserted
the InOrder, PreOrder, and PostOrder traversals can be accomplished using
recursion
the first node in a binary tree list is called the
root node
in a binary tree class you usually have a pointer as a member that is set to the
root of the tree
the _________ in a binary tree is similar to the head pointer in a linked list
root pointer
when an application begins by searching a binary tree, it starts at
the root node
a binary tree with a height of three has
three levels
a good reason to use the binary tree structure is
to expedite the process of searching large sets of information
the process of stepping through the nodes of a binary tree is known as
traversing
the head pointer, anchored at the top of a binary tree, may be called the
tree pointer
a binary tree can be created using a struct or class containing a data value and
two pointers, one for the left child and one for the right child