Linked lists are a collection of nodes with a next attribute (and previous if using a Doubly Linked List) that can only be traversed in order of the next attributes. The node.next attribute will commonly be referred to as a pointer because under the hood, the next attribute is storing the memory location of the following node. See below for a common representation
Binary Trees are a collection of nodes with attributes left, right, and value. When inserting a new node into a binary tree, if the value is less than the root node you compare the value to the left node, if it's greater than you check against the right. You repeat this process down the tree until you reach a node without a connection in the left/right attribute and place it there.