Exam 19: Binary Trees

Three lines at the end of an arrow in the diagram of a binary tree indicate that the subtree ____.

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 operations to do inorder,preorder,and postorder traversals of a binary search tree are the same as those for a binary tree.

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

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

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

To delete an item from the binary search tree,you must do the following: 1.Find the node containing the item (if any)to be deleted. 2.Delete the node.

After deleting the desired item from a binary search tree,the resulting tree must be a binary search tree.

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

Each link in a binary tree node points to a(n)____ of that node.

The search function searches the binary search tree for a given item.If the item is found in the binary search tree,it returns ____.

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

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

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

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

In a binary tree,the branches go only from a child to a parent.

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

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

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

A binary tree is empty if root is ____.