Topic: Data Structure and Algorithm using $C$ language.

Q$10)$ Given a linked list, return an array greater$[]$ where every ith element of greater contains the

node value of the linked list which is strictly greater than the ith node $(1$ indexed$).$ If a greater node is

not available, it is set to $0.$

Example, given following list input : $2,7,4,3,5$

Returns : $7,0,5,5,0$