Recursive solution for a pen question

// Find the nth last node and return its pointer
// Convention: Last node: Last Node

Code:

1. # Include <iostream>
2. Using namespace STD;
3. Typedef struct Node
4. {
5. Int data;
6. Struct node * next;
7. } Link_node;
9. Link_node * root = NULL;
11. Void initialize (int A [], int Len)
12. {
13. For (INT I = 0; I <Len; I ++)
14. {
15. Link_node * node = new link_node;
16. Node-> DATA = A [I];
17. Node-> next = root;
18. Root = node;
19. }
20. }
21. Void print (link_node * _ root)
22. {
23. While (_ root! = NULL)
24. {
25. Cout <_ root-> data <"";
26. _ Root = _ root-> next;
27. }
28. Cout <Endl;
29. }
30. // Find the nth last node and return its pointer
31. // Convention: Last node: Last Node
32. Link_node * findlastn (link_node * _ root, int Len, int N)
33. {
34. If (_ root = NULL | n> Len)
35. {
36. Return NULL;
37. }
38. If (LEN = N)
39. {
40. Return _ root;
41. }
42. Return findlastn (_ root-> next, len-1, n );
43. }
44. Int calculatelen (link_node * node)
45. {
46. Int Len = 0;
48. While (node! = NULL)
49. {
50. Len ++;
51. Node = node-> next;
52. }
53. Return Len;
54. }
56. Void main ()
57. {
58. Int A [10] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
59. Initialize (A, 10 );
60. Print (Root );
61. Int Len = calculatelen (Root );
63. Int N;
64. While (1)
65. {
66. Cin> N;
67. If (n =-1)
68. {
69. Break;
70. }
71. Link_node * node = findlastn (root, Len, N );
72. If (node = NULL)
73. {
74. Cout <"No found" <Endl;
75. } Else {
76. Cout <node-> data <Endl;
77. }
79. }
80. }