Exam 11: Binary Trees and B-Trees

Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree.

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

After inserting an item in a binary search tree, the resulting binary tree must also be a binary search tree.

In a ____ the root has at least 2 children if it is not a leaf, and at most m children.

The class implementing the properties of a B-tree must, among others, implement the search, traversal, insertion, and deletion algorithms.

An ____ is a tree in which each node has at most m children.

Operations, such as finding the height, determining the number of nodes, checking whether the tree is empty, tree traversal, and so on, on AVL trees cannot be implemented the same way they are implemented on binary trees.

Every node in a binary tree has at most three children.

Because the insertion of an item might require the splitting of a node and moving the median key to the parent node, the simplest way to implement the insertion algorithm is to use ____.

Because an array is not a random access data structure, we cannot use a binary search to effectively find and retrieve an item from an array list.

Item insertion and deletion in a linked list requires significant data movement.

The item insertion, deletion, and lookup operations require that the binary tree be ____.

Each node should store the number of keys in the node, the records, and the pointer to subtrees.

The performance of the search algorithm on a binary search tree depends on how large the binary tree is.

When inserting into a B-tree, if the key is not in the tree, the search terminates at a ____.

The basic operations performed on a B-tree are search the tree, insert an item in the tree, delete an item from the tree, and ____.

The height of a perfectly balanced binary tree with n nodes is ____.

When inserting into a B-tree, if the key is already in the tree, you should output an error message.

To delete a node, we adjust one of the pointers of the ____.

One of the drawbacks of linked lists is that they must be processed ____.