dwa_1066_binary_tree.py

class Node:
	def __init__(self, data):
		self.data = data
		self.left = None
		self.right = None

	def insert(self, data):
		if self.data:
			if data < self.data:
				if self.left is None:
					self.left = Node(data=data)
				else:
					self.left.insert(data=data)
			elif data > self.data:
				if self.right is None:
					self.right = Node(data=data)
				else:
					self.right.insert(data=data)
		else:
			self.data = Node(data=data)

	def print_tree(self):
		if self.left:
			self.left.print_tree()
		print(f"{self.data},")
		if self.right:
			self.right.print_tree()

root = Node(27)
root.insert(14)
root.insert(35)
root.insert(31)
root.insert(10)
root.insert(19)

root.print_tree()