Python implementation of a Binary Search Tree

Here is the python implementation of a binary search tree. Here the binary tree is printed out using preorder.

Singly Linked List Implementation in python

Below is a very simplistic implementation of a singly linked list. The linked list implementation is done using two classes Node and LinkedList. Node is a class representing each node of the linked list and LinkedList is a class representing the whole linked list itself.