Exam 9: Searching and Sorting

The simulated link strategy does not allow array positions to be allocated contiguously regardless of the completeness of the tree.

The simulated link strategy allows array positions to be allocated contiguously regardless of the _________ of the tree.

What are the advantages and disadvantages of the computational strategy?

Preorder traversal means visit the left child, then the right child, then the node.

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

A collection where each node can have from 0 to 2 children is called a ___________.

-A ______ is a nonlinear structure whose elements are organized into a hierarchy.

-There are four basic methods for traversing a tree: ______.

A collection where each node can have from 0 to 3 children is called a Binary Tree.

-The ______ strategy allows array positions to be allocated contiguously regardless of the completeness of the tree.

The binary tree shown above is balanced.

Define the height of a tree.

In general, a balanced n-ary tree with m elements will have height log_nm.

Level-order traversal means visit the nodes at each level, one level at at time, starting with the root.

A node that does not have a ______ is called the root of a tree.

_________ traversal means visit the node, then the left child, then the right child.

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

Define the level of a node.

A node that has both a parent and at least one child is called a(n) ______ node.

A tree is a nonlinear structure whose elements are organized into a __________.