find height of a binary tree without recursion

height.py

"""
基本思想：利用层序遍历，浮标法记录最大值
Node struct:
class Node:
    def __init__(self, data, left, right):
        self.data = data
        self.left = left
        self.right = right
"""

def findHeight(root):
    queue = [(root, 0)]
    ml = 0;
    while queue:
        curr = queue.pop(0)
        node = curr[0]
        cl = curr[1]
        if cl > ml:
            ml = cl
        if node.left:
            queue.append((node.left, cl+1))
        if node.right:
            queue.append((node.right, cl+1))
    return ml