¡@
python Programming Glossary: node.leftHelp me understand Inorder Traversal without using recursion http://stackoverflow.com/questions/2116662/help-me-understand-inorder-traversal-without-using-recursion Lifo lifo.push node while True if node is None break if node.left is not None lifo.push node.left node node.left continue prev.. if node is None break if node.left is not None lifo.push node.left node node.left continue prev node while True if node is None.. break if node.left is not None lifo.push node.left node node.left continue prev node while True if node is None break print node.value..
|