Write a function that takes a binary search tree as input and produces a linked list of the entries with the entries sorted. Hint: Use in-order transversal. The header file definition is: You must use the following function to flatten the tree into sorted linked list.

void makelist(node*& head_ptr, node*& tail_ptr, binary_tree_node* r);

You can use the following inorder transversal without modifying it.

template  void inorder(Process f, BTNode* node_ptr) // Library facilities used: cstdlib { if (node_ptr != NULL) { inorder(f, node_ptr->left( )); f( node_ptr->data( ) ); inorder(f, node_ptr->right( )); } }