Day23 - BST Level-Order Traversal (Python 3)
Post
Cancel

# Day23 - BST Level-Order Traversal (Python 3)

• Objective
• Today, we’re going further with Binary Search Trees. Check out the Tutorial tab for learning materials and an instructional video!
• A level-order traversal, also known as a breadth-first search, visits each level of a tree’s nodes from left to right, top to bottom. You are given a pointer, root, pointing to the root of a binary search tree. Complete the levelOrder function provided in your editor so that it prints the level-order traversal of the binary search tree.
• Hint: You’ll find a queue helpful in completing this challenge.

• Input Format
• The locked stub code in your editor reads the following inputs and assembles them into a BST:
• The first line contains an integer, T (the number of test cases).
• The T subsequent lines each contain an integer, data, denoting the value of an element that must be added to the BST.
• Output Format
• Print the data value of each node in the tree’s level-order traversal as a single line of N space-separated integers.
```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 import sys class Node: def __init__(self,data): self.right=self.left=None self.data = data class Solution: def insert(self,root,data): if root==None: return Node(data) else: if data<=root.data: cur=self.insert(root.left,data) root.left=cur else: cur=self.insert(root.right,data) root.right=cur return root def levelOrder(self,root): #Write your code here queue = [root] while queue: node = queue.pop() print(node.data, end =' ') if node.left: queue.insert(False, node.left) if node.right: queue.insert(False, node.right) ```