A little bit of everything: software, apps, usability, programming, design and whatever else
@OJ — I’ve tweaked the question a bit to hopefully answer your questions. I always try to leave a little wiggle room for some creativity … but within limits. 
Much better 
There was too much room to move if we had control over constructing the tree ourselves.
So we can assume that all we have is a reference to a root node of the tree. And the structure for the node would be simply:
struct TreeNode { TreeNode* left; TreeNode* right; T value; }
That’s the hard part about doing these on paper like this – there’s less of an opportunity to “tune” the questions. Thanks for asking ….!
(And yes, you’re right about the basic structure of the tree node).
I guess we’ll have to resort to the tried-and-true stack-based approach then
©2007-2012 WiredPrairie
Disclaimer: All data and information provided on this site is for informational purposes only.
In association with Amazon
WordPress Themes by Irish Band & Steel Band
(And, quite a few tweaks by WiredPrairie)
How flexible is this question? More specifically, are we supposed to iterate through the tree given just the root tree node? or are we able to be creative in the construction of the tree (so long as it remains a binary tree)?