2012年5月10日
二叉树后序遍历<非递归>
摘要： while(curr) { //print left most node, notice the root node if ((curr->left && curr->left->visited == false) || (curr->right && curr->right->visited == false)) { while (curr->left || curr->right) { if (curr->left && curr->left->visited == false 阅读全文
posted @ 2012-05-10 22:51 Jack204 阅读(447) 评论(0) 推荐(0)