We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def levelOrder(self,root):
#Write your code here
queue = [root]
while queue:
node = queue.pop(0) # Pop from the front
print(f"{node.data}", end=" ")
for new in [node.left, node.right]:
if new:
queue.append(new)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 23: BST Level-Order Traversal
You are viewing a single comment's thread. Return to all comments →