Description: Nonrecursive preorder binary tree, using the stack has been left to go root-> left-> left-> left ...-> null, as is the preorder, it encountered a node, we need immediate access as has come to the after the left, we need to gradually return to the parent node to access the right node, so there must be able to measure a sequence of nodes backtracking. There are two ways: 1. Stack Memory: The saved nodes sequentially encountered in the access way. Since the node order and restore order in reverse order, so that is a last-out structure, need to use the stack. 2. The node point increase pointer to the parent: by pointing a pointer to the parent node back
To Search:
File list (Check if you may need any files):
preorder_tree_stack.cpp
Download