Exam 11: Binary Trees and B-Trees

The performance of a binary search tree depends on the width of the tree.

When deleting from a B-tree, if the leaf contains only the minimum number of keys, look at the sibling nodes that are adjacent to the leaf.

A sequential search is good only for very small lists because the average search length of a sequential search is half the size of the list.

In an array, item insertion (especially if the array is sorted) and item deletion can be very time consuming, especially if the list size is very large.

The balance factor of x, written bf(x), is defined by ____.

A binary tree is a dynamic data structure.

In C++, a function name without any parentheses is considered a ____.

In the worst case, the height of an AVL tree with n nodes is approximately ____.

The reconstruction procedure for an AVL tree is called ____.

There are two types of AVL tree rotations: ____.

In a preorder traversal of a binary tree, after visiting a node and before moving to the right subtree, we must save a pointer to the node so that after visiting the right subtree, we can visit the left subtree.

In a ____ traversal of a binary tree, for each node, first the left subtree is visited, then the right subtree is visited, and then the node is visited.

The ____ is one in which the resulting binary search is nearly balanced.

To insert an item in an AVL tree, first we search the tree and find the place where the new item is to be inserted.

After inserting the node, the reconstruction can occur at any node on the path back to the root node.

If the item to be inserted in an AVL tree is already in the tree, the search ends at a ____.

The function ____ searches the binary search tree for a given item.

A B-tree can be ____ in three ways: inorder, preorder, and postorder.

To specify a function as a formal parameter to another function, we specify the function type, followed by the function name as a pointer, followed by the parameter types of the function.

Let x be a node in a binary tree, then we say that the node x violates the ____ if |x_h - x₁| > 1, that is, the heights of the left and right subtrees of x differ by more than 1.