contains # lt; Stdio.h & gt; #to & lt include, conio.h & gt; #to & lt include, windows.h & gt; Structure node {int a; Structure node * next; }; Zero constructivist (Structure node ** head) {struct node * p, * temp; Int n; Printf ("Enter number \ n"); Scanf ("% d", & amp; n); P = (straight node *) maulok (psychophag (strip node)); P-> = N; If (* head == 0) {* head = p; P-> Next = 0; Temporary = p; } And {temp-> next = p; Temporary = p; P-> Next = 0; }} Void frontbacksplit (Structure node ** head, Structure node ** Head1, Structure node ** Head 2) {int counter = 0, i; Structure node * temporary, * p; Temporary = * head; While (temporary! = 0) {counter ++; Temporary = temp-> Next; } Int n; If (counter% 2 == 0) {n = counter / 2; } And {n = (counter + 1) / 2; } Temp = * head; (I = 0; i & lt; n-1; i ++) for {if (* head1 == 0) {* head1 = temp; } Temp = temp- & gt; next; } P = temp; Temporary = temp-> Next; P-> Next ...
Comments
Post a Comment