python Programming Glossary: node.right
Help me understand Inorder Traversal without using recursion http://stackoverflow.com/questions/2116662/help-me-understand-inorder-traversal-without-using-recursion print node.value prev node node lifo.pop node prev if node.right is not None lifo.push node.right node node.right else break.. lifo.pop node prev if node.right is not None lifo.push node.right node node.right else break The inner while loop just doesn't.. prev if node.right is not None lifo.push node.right node node.right else break The inner while loop just doesn't feel right. Also..
|