Exam 19: Binary Trees

1.current = root; 2.while (current is not NULL or stack is nonempty) if (current is not NULL) { visit current node; push current onto stack; current = current->lLink; } else { current = stack.top(); pop stack; current = current->rLink; //move to the right child }

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

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.

The most common operation performed on a binary tree is a(n)____.

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.

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 ____.

All binary tree traversals start at the left-most child node.

Duplicates are allowed in a binary search tree.

The three traversal algorithms discussed for binary trees are ____,____,and ____.

A binary tree is also a(n)____.

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

Every node in a binary tree has ____ pointers.

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

To destroy a binary tree,for each node,first we destroy its left subtree,then its right subtree,and then the node itself.We must then use the operator ____________________ to deallocate the memory occupied by the node.

The sequence of operations in a postorder traversal is ____.

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

The item search,insertion,and deletion operations all require the binary tree to be traversed.

When a class object is passed by value,the ____________________ constructor copies the value of the actual parameters into the formal parameters.

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

In addition to the inorder,preorder,and postorder traversals,a binary tree can also be traversed level-by-level,which is also known as ____________________ traversal.