In a linked list, the items are linked together through a single next pointer.
In a binary tree, each node can have 0, 1 or 2 subnodes, where (in case of a binary search tree) the key of the left node is lesser than the key of the node and the key of the right node is more than the node.
As long as the tree is balanced, the searchpath to each item is a lot shorter than that in a linked list
Main difference is that BST can be sorted easily, and we can say its sorted already.
Linked lists preserve insertion order and inserting is less expensive , while in BST insertion is expensive.
same in case for Removal, Removing a node from LinkedList is easy if you have previous node info, to be delated node info.
But in BST it expensive as again we need to order the BST.
Item(1) -> Item(2) -> Item(3) -> Item(4) -> Item(5) -> Item(6) -> Item(7)
RootNode(4) / \ Node(2) Node(6) / \ / \ Node(1) Node(3) Node(5) Node(7)