diff --git a/Binary_search.py b/Binary_search.py
new file mode 100644
index 0000000..7eef8e4
--- /dev/null
+++ b/Binary_search.py
@@ -0,0 +1,37 @@
+# Python program to introduce Binary Tree
+
+# A class that represents an individual node
+# in a Binary Tree
+class Node:
+	def __init__(self, key):
+		self.left = None
+		self.right = None
+		self.val = key
+
+
+if __name__ == '__main__':
+	# Create root
+	root = Node(1)
+	''' following is the tree after above statement
+		1
+	/ \
+	None None'''
+	
+	root.left = Node(2)
+	root.right = Node(3)
+	''' 2 and 3 become left and right children of 1
+		1
+		/ \
+		2	 3
+	/ \ / \
+	None None None None'''
+	
+	root.left.left = Node(4)
+	'''4 becomes left child of 2
+			1
+		/	 \
+		2		 3
+		/ \	 / \
+	4 None None None
+	/ \
+	None None'''