Exam 19: Binary Trees

The ____________________ of a path in a binary tree is the number of branches on that path.

In a(n) ____________________ traversal, the binary tree is traversed as follows:1.Visit the node. 2.Traverse the left subtree. 3.Traverse the right subtree.

In a binary tree, the level of the children of the root node is ____.

A pointer to the root node of the binary tree is stored outside the binary tree in a pointer variable, usually called the ____.

In a diagram of a binary tree, each node is represented as a(n) ____.

For classes with pointer data members, you must explicitly overload the assignment operator and include the destructor.

In a binary search tree, the data in each node is ____ the data in the left child.

Let T be a binary search tree with n nodes, in which n > 0.When T is linear, the search algorithm makes ____________________ key comparisons, in the unsuccessful case.

In copying a binary tree, if you use just the value of the pointer of the root node, you get a ____ copy of the data.

The level of the root node of a binary tree is 1.

The ____ of a node in a binary tree is the number of branches on the path from the root to the node.

In the diagram of a binary tree, an arrow is called a(n) ____.

A binary tree has a special node called the ____ node.

After inserting an item in a binary search tree, the resulting binary tree must be a(n) ____________________.

A binary tree is also a(n) ____.

The ____________________ of a binary tree is the number of nodes on the longest path from the root to a leaf.

In C++, a function name without any parentheses is considered a pointer to the function.

Assume the key of the left child below the root node of a binary search tree is 30.The value in the root node could be ____.

When traversing a binary tree, the pointer current is initialized to ____.

A node in a binary tree is called a(n) ____ if it has no left and right children.