摘要：
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 阅读全文
