摘要：Populating Next Right Pointers in Each NodeReversing linked list iteratively and recursively1) The iterative way:void reverse(Node*& head) { if (!head) return; Node* prev = NULL; Node* curr = head; while (curr) { Node* next = curr->next; curr->next = prev; prev = cur... 阅读全文