kagan94 · September 27, 2016 13:53
diff --git a/breadth-first output of the b-tree b/breadth-first output of the b-tree
    def depth_first(self, root):
        Q = [root]
        elems = []
        
        while len(Q):        
            current = Q.pop(0)

            elems.append(current.data)

            if current.left is not None:
                Q.append(current.left)
            if current.right is not None:
                Q.append(current.right)
        
        print(*elems)
	def depth_first(self, root):
	Q = [root]
	elems = []

	while len(Q):
	current = Q.pop(0)

	elems.append(current.data)

	if current.left is not None:
	Q.append(current.left)
	if current.right is not None:
	Q.append(current.right)

	print(*elems)