True or false? 1. Invoking the delete function in this chapter might create a tree with more levels than the original tree had. 2. A preorder traversal processes the nodes in a tree in the exact reverse order that a postorder traversal processes them. 3. An inorder traversal always processes the elements of a tree in the same order, regardless of the order in which the elements were inserted. 4.

A preorder traversal always processes the elements of a tree in the same order, regardless of the order in which the elements were inserted.