From the lecture, What is the key difference between buildListForward$()$ and buildListBackward$()$ when creating a linked list?

buildListForward$()$ uses less memory

buildListBackward$()$ is always faster

buildListForward$()$ inserts at the end, buildListBackward$()$ inserts at the beginning

buildListBackward$()$ creates nodes in reverse order of the data