Comments on: Coding Challenge #15

By: OJ

OJ — Thu, 24 Jul 2008 22:03:44 +0000

I guess we’ll have to resort to the tried-and-true stack-based approach then

By: Aaron

Aaron — Thu, 24 Jul 2008 02:43:10 +0000

(And yes, you’re right about the basic structure of the tree node).

By: Aaron

Aaron — Thu, 24 Jul 2008 02:42:48 +0000

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 ….!

By: OJ

OJ — Thu, 24 Jul 2008 01:41:57 +0000

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; }

By: Aaron

Aaron — Thu, 24 Jul 2008 00:44:21 +0000

@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.

By: OJ

OJ — Thu, 24 Jul 2008 00:14:54 +0000

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)?