/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
void pre_dfs(TreeNode* pRoot){
stack<TreeNode*> s;
TreeNode* p = pRoot;
s.push(pRoot);
while(!s.empty()){
p = s.top();
s.pop();
std::cout<<p->val;
if(p->right) s.push(p->right);
if(p->left) s.push(p->left);
}
std::cout<<std::endl;
}