Is this your company?
Write a function that takes a binary tree as input, and have it perform in order traversal.
Anonymous
void inOrder(node* aNode) { if(aNode->iLeft) { inOrder(aNode->iLeft); } cout iRight) { inOrder(aNode->iRight); } }
Check out your Company Bowl for anonymous work chats.