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.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 23: BST Level-Order Traversal
  5. Discussions

Day 23: BST Level-Order Traversal

Sort by

recency

|

426 Discussions

|

  • rb_bruins94
     + 0 comments
     def levelOrder(self,root):
    queue = [root]
    for item in queue:
        if item.left:
            queue.append(item.left)
        if item.right:
            queue.append(item.right)
    print(" ".join([str(i.data) for i in queue]))

  • ors_subs
     + 0 comments
    void levelOrder(Node * root){
 vector<Node*> oQ;
 
 if (nullptr != root) {
  oQ.push_back(root);

  for(int i=0; i<oQ.size(); i++) {
   cout<<oQ[i]->data<<" ";

   if (nullptr != oQ[i]->left)
    oQ.push_back(oQ[i]->left);

   if (nullptr != oQ[i]->right)
    oQ.push_back(oQ[i]->right);
  }
 }
}

  • marc_davies
     + 1 comment
    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)

  • scottavanlee
     + 0 comments
    Python3

    def levelOrder(self,root):
    #Write your code here
    if root is None:
        return
    queue = [root]
    while queue:
        node = queue.pop(0)
        print(node.data, end=" ")
        if node.left:
            queue.append(node.left)
        if node.right:
            queue.append(node.right)

  • burzum17
     + 0 comments

    swift solution

    func levelOrder(root: Node?) -> Void {
        guard let root = root else { return }
        var result: [Int] = []
        var queue:[Node] = []
        queue.append(root)
        while !queue.isEmpty {
            let node = queue.removeFirst()
            if let left = node.left {
                queue.append(left)
            }
            
            if let right = node.right {
                queue.append(right)
            }
            result.append(node.data)
        }
        print(result.map { String($0) }.joined(separator: " "))
    	// Complete the function
    } // End of levelOrder function