void PreOrder(TreeNode* root)
{
print root->value;
PreOrder(root->left);
PreOrder(root->right);
}
void PreOrder(TreeNode* root)
{
if(root == NULL)
return;
stack.push(root);
while(!stack.IsEmpty)
{
TreeNode node = stack.pop();
print node->value;
if(node->right != NULL) stack.push(node->right);
if(node->left != NULL) stack.push(node->left);
}
}
先序递归