华为面试（HUAWEI interview）.docVIP

华为面试（HUAWEI interview） 10., attached ZTE mobile written examination questions (not signed confidentiality agreement, so write it out) The recursive algorithm combines two ascending order lists into a new list Non recursive method Node*, insert_node (node, *head, node, *item), //head, =NULL {node *p=head; Node *q=NULL; While (p-dataitem-data =NULL P!) {q=p; P=p-next; } If (p==head) {item-next=p; Return item; } Q-next=item; Item-next=p; Return head; } Recursive Method Node *MergeRecursive (node, *head1, node, *head2) {node *head=NULL; If (head1==NULL) {return Head2} If (head2==NULL) {return he