二叉树遍历(中序)
摘要:
void PreOrder(TreeNode *root) { TreeNode *p = root; stack s; while (!s.empty() || p) { while (p) { s.push(p); p = p->left; } if (!s.empty()) { p = s.top(); s.pop(); cout... 阅读全文
posted @ 2017-09-18 16:35 www_practice 阅读(96) 评论(0) 推荐(0) 编辑