Remember, the only restriction on the structure of the tree is for each node to have 2 children - the balance of the tree is not restricted.
Questions so far:
How do you find the height of a binary tree?

Criteria:
Non-recursive


You may use any programming language or explain the idea behind it - thank you!
I'm willing to pay for a solution that will help me while fulfilling the criteria.

Are you kidding? You can't google the answer to this question? Or perhaps read the book I'm sure they had you buy for the class? I assure you it is not difficult, I would suggest drawing one up or just look at the wiki page on binary tree's I'm sure that has the answer you are looking for.

This post was edited by SilverMice on Jan 17 2013 08:29pm

Sorry, it's not for a class or I would have put this probably in the homework help line - I just happen to read something on binary trees and I wondered how this could be solved in an algorithm.
Edit: Also, I have done some googling and I have read recursive solutions - hence my criteria.

This post was edited by MsRailgun on Jan 17 2013 09:00pm

http://stackoverflow.com/questions/11925631/non-recursive-program-to-find-minimum-height-of-binary-tree

First site in google search. Does it adequately answer your question?

well the number of bits required to number a 'row' in the tree, is equal to the number of rows above it, for example:

here the final row requires 3 bits to enumerate the row, so there are 3 rows above it

Thanks, I've also looked at it but I'd prefer the idea behind it instead of the code.

@

This is an interesting approach - how would you label a node that is not existent? Because what you drew is balanced on both sides; but, what if a tree has many branches with only 1 node that has 3 bits - that would mean I'd have to transcend the tree to find it :o.

Binary trees don't have nodes with 3 children. Additionally you said 'every node to have 2 children', so there won't be any "missing nodes".

Take the first node, the left node is null - the right node is something. The ride node then branches off into two non-null nodes - etc.?

iterative DFS/BFS, with or without backtracking, with a maxheight variable

This post was edited by irimi on Jan 18 2013 05:38pm