Exam 19: Binary Trees

The operations to do inorder, preorder, and postorder traversals of a binary search tree are the same as those for a binary tree.

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

The sequence of operations in a postorder traversal is ____.

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

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

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.

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

Consider that A is a binary tree, C and D are the subtrees of A.Which of the following statements is always true?

The key of the right child below the root node of a search binary tree is 40.The value in the root node could be ____.

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

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

Duplicates are allowed in a binary search tree.

The listing of the nodes produced by the preorder traversal of a binary tree is called the ____________________.

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

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

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

The listing of the nodes produced by the postorder traversal of a binary tree is called the ____.

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.

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

Every node in a binary tree has ____ pointers.