Question

A B-tree can be ____ in three ways: inorder, preorder, and postorder.

A.
copied

B.
reversed

C.
traversed

Answer 1

traversed

Step-by-step explanation:

B-tree is a self balancing tree and it is a data structure which allows insertion, deletion operations.

inorder, preorder and post order, they all are traversing algorithms in the tree data structure.

inorder: first print left, then root and then right.

preorder: first print root, then left and then right.

postorder: first print left, then right and then root.

Therefore, the answer is traversed.