Printing only a certain section of a binary treeIt sounds like you need a find() function to find a node with specific data.
how to make a priority queue/min heapIn your example, myqueue is a local variable and you are either adding something to it (lines 9-10) ...
Simplifying switch casesJust use isdigit(). That's what it's there for.
Printing only a certain section of a binary tree[code]allBut(Node *node) { if (node) { InOrder(node->left); InOrder(node->right)...
how to make a priority queue/min heappriority_queue is part of the STL. Just use that. http://www.cplusplus.com/reference/queue/priority_...