-
Notifications
You must be signed in to change notification settings - Fork 0
/
link.c
82 lines (78 loc) · 1.19 KB
/
link.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include<stdio.h>
#include<stdlib.h>
typedef struct node {
int val;
struct node *next;
}node;
void insert(node **head,int n)
{
node *temp;
if(*head == NULL) {
temp = (node *)malloc(sizeof(node));
temp->val = n;
*head = temp;
(*head)->next = NULL;
//printf("inserting %d\n",n);
}
else {
insert(&((*head)->next),n);
}
}
void print(node *head)
{
/*if(head == NULL) {
return;
}else {
if(head->next == NULL) {
printf("%d-->",head->val);
}else {
printf("%d-->",head->val);
print(head->next);
}
}*/
//while(head != NULL) {
// printf("%d-->",head->val);
// head = head->next;
//}
printf("%d-->",head->val);
if(head->next == NULL)
return;
print(head->next);
}
int kth_node(node *head,int k)
{
int count;
count = 1;
while(count != k) {
head = head->next;
count++;
}
return head->val;
}
node **find(node **head,int k)
{
int count;
count = 1;
while(count != k-1) {
*head = *head->next;
count++;
}
return *head;
}
void delete(node **head,int k)
{
int main()
{
int n,k;
node *head = NULL;
while( 999){
scanf("%d",&n);
if(n == 999)
break;
insert(&head,n);
}
print(head);
scanf("%d",&k);
printf("kth node is %d\n",kth_node(head,k));
return 0;
}