Need help understanding some concepts for data structures class

Hi there, I have an exam coming up for my data structures course and I wanted to potentially have some help understanding linked lists and binary trees/search trees. I understand them at a conceptual level(i.e. how they are represented visually). But I am completely lost when it comes to the actual implementation of them into code. Could someone help explain how to implement the different operations(traversal, search, insertion, and deletion) on linked lists and binary search trees?