This is for review and need help with this quiz. this is in the c language

Which one of the following represents a valid "BST"? d. Write out the INORDER traversal sequence for the tree diagram "A" above. e. Write out the PREORDER traversal sequence for the tree diagram "A" above. T/F Some binary trees will have 3 or more nodes (children). T/F The simple insertion algorithm we discussed in class and used in labs does not guarantee that the resulting BST is balanced. A perfectly balanced BST can be constructed directly from a sorted array in 0 (______) time. The content-specific ordering a BST allows it to satisfy search operations efficiently and can be represented with big O notation as __________. What is the following code designed to do with a BST? struct treenode*fred(int d, struct treenode*p) { if(p == null) { p = (struct treenode*) (malloc(sizeof(struct treenode))): p data = d: p left = NULL: p right = NULL: } else if(d p data) p right = fred (d, p right): return p: }