How to determinate the FINAL path from the Closed List?

So i have the A* Algorithm almost done It works fine finds the best path but then when you have the list. How do u turn that to the final path? Like when it goes around obstacles it adds alot to the list. I heard this is done somehow with “parent” nodes and following them at the end? Im not quite sure how this is done. Like in this video From 43:43. What i understand this far is that you should then later follow the path from the end to the start and use the nodes that are closest to the starting point?