iterative pre order traversal

21.cpp

void preorder(root){
  stk.push(root);
  while(!stk.empty()){
    cout << stk.top();
    stk.pop();
    if(root -> right) stk.push(root->right);
    if(root -> left) stk.push(root -> left);
  }
}