Exercise 10.2.7
Give a
Θ(n) -time nonrecursive procedure that reverses a singly linked list ofn elements. The procedure should use no more than a constant storage beyond that needed for the list itself.
Read full article from Exercise 10.2.7
Give a
Θ(n) -time nonrecursive procedure that reverses a singly linked list ofn elements. The procedure should use no more than a constant storage beyond that needed for the list itself.
Read full article from Exercise 10.2.7
No comments:
Post a Comment