Consider the following code segment in C to traverse a binary tree using the preorder typedef struct tree { int info; struct *left; struct *right; }node; void preorder(node *tree) { if (t) { Statementl Statement2 Statement3 } } The above Statements should be

• A. preorder(tree->right); preorder(tree->left); printf("%d", tree->info);
• B. preorder(tree->left); preorder(tree->right); printf("%d", tree->info);
• C. preorder(tree->left); printf("%d", tree->info); preorder(tree->right);
• D. printf("%d", tree->info); preorder(tree->left); preorder(tree->right);