Data Structure Final Exam Review (Multiple Choice)

subtree

A ___________ is a tree structure that makes up part of another tree

log2m

A balanced binary tree with m nodes has a height of _______

lognm

A balanced n-ary tree with m elements will have a height of _______

dynamic structure

A linked list is considered to be a _________________ because its size grows and shrinks as needed

parent

A node can have only one __________, but may have multiple children

ancestor

A node is an ____________ of another node if it is above it on the path from the root.

leaf

A node that has no children is a _______ node

internal node

A node that is not the root and has at least one child is an ________________

complete

A tree is ____________ if it is full, or full to the next-to-last level with all leaves at the bottom level on the left side of the tree

n-ary tree

A tree that limits each node to no more than n children is referred to as an ____________

full

An n-ary tree is _______ if all leaves of the tree are at the same height and every non-leaf node has exactly n children

infix; operator is placed between its operands

Arithmetic operations are traditionally written in _____ notation, meaning that the _______________________________ in the form

expert systems

Decision trees are sometimes used in ________________ - software that attempts to represent the knowledge of an expert in a particular field

postfix

In a _________ expression, the operator comes after its two operands

doubly linked list

In a _______________________, each node in the list stores both a reference to the next element and a reference to the previous one

last in, first out (LIFO) manner

Stacks are processed in a...

level

The _______ of a node is the length of the path from the root to the node

path length

The _____________ is determined by counting the number of edges that must be followed to get from the root to the node

height (or depth)

The ________________ of a tree is the length of the longest path from the root to a leaf

root

There is only one ______ node in the tree

circular array (queue)

To avoid shifting elements, we will use a ________________ to implement the queue

nodes; edges

Tree is comprised of a set of ________ in which elements are stored and ________ connect one node to another

binary trees

Trees in which nodes may have at most two children

top

Usually, stacks are depicted vertically, and we refer to the ____ of the stack as the end to which elements are added and removed

path

We can follow a ________ through a tree from parent to child, starting at the root

first in, first out (FIFO) manner

We say that queue elements are processed in a...

binary search

eliminates large parts of the search pool with each comparison

general trees

have no limit to the number of children a node may have

balanced tree

if all of the leaves of the tree are on the same level or at least within one level of each other

graphs

nonlinear structures in which nodes may be connected to many other nodes, with no particular parent/child relationships

linear search

simply examines each item in the search pool, one at a time, until either the target is found or until the pool is exhausted

sometimes referred to as the order of the tree

the maximum number of children any node in the tree may have

level

Each node is located on a particular _____

children

Nodes at the lower level of a tree are the _____________ of nodes at the previous level

descendants

Nodes that can be reached by following a path from a particular node are the __________________ of that node

siblings

Nodes that have the same parent are ____________

nodes

Often the objects stored in a linked list are referred to generically as the _________ in the list

heap

a complete binary tree in which each element is greater than or equal to both of its children

linked structure

a data structure that uses object reference variables to create links between objects

Stack

a linear collection whose elements are added and removed from the same end

Queue

a linear collection whose elements are added on one end and removed from the other

tree

a non-linear structure in which elements are organized into a hierarchy

decision tree

a tree whose nodes represent decision points, and whose children represent the options available