Breaking News: Grepper is joining You.com. Read the official announcement!

Level order binary tree

Adam, the developer answered on October 7, 2022 Popularity 8/10 Helpfulness 3/10

answer Level order binary tree

Level order binary tree

Comment

class Node:
	# A utility function to create a new node
	def __init__(self, key):
		self.data = key
		self.left = None
		self.right = None

# Iterative Method to print the
# height of a binary tree


def printLevelOrder(root):
	# Base Case
	if root is None:
		return

	# Create an empty queue
	# for level order traversal
	queue = []

	# Enqueue Root and initialize height
	queue.append(root)

	while(len(queue) > 0):

		# Print front of queue and
		# remove it from queue
		print(queue[0].data, end = " ")
		node = queue.pop(0)

		# Enqueue left child
		if node.left is not None:
			queue.append(node.left)

		# Enqueue right child
		if node.right is not None:
			queue.append(node.right)


# Driver Program to test above function
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)

print("Level Order Traversal of binary tree is: ")
printLevelOrder(root)

Popularity 8/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: binary-tree python

Link to this answer
Share Copy Link

Contributed on Oct 07 2022

Adam, the developer

0 Answers Avg Quality 2/10

Level order binary tree

Contents

More Related Answers

Level order binary tree

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.