Problem in Reversing a linked list without using recursion.
I used this method, but when i try and run this back home, I am not able to print the reverse of the lin
check your condition: while (isEmpty(head))
you forgot to add the "!" you meant while not empty... do