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

"Binary Tree Level Order Traversal" Algorithms

Add Answer

Witty Whale answered on January 16, 2022 Popularity 6/10 Helpfulness 2/10

answer "Binary Tree Level Order Traversal" Algorithms

related binary tree level traversal

related binary tree level order traversal

related level order traversal of binary tree c++

"Binary Tree Level Order Traversal" Algorithms

Comment

printLevelorder(tree)
1) Create an empty queue q
2) temp_node = root /*start from root*/
3) Loop while temp_node is not NULL
    a) print temp_node->data.
    b) Dequeue a node from q.
    c) Enqueue temp_node’s children 
      (first left then right children) to q
    d) assign temp_node = q.front()

Popularity 6/10 Helpfulness 2/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Jul 30 2022

Witty Whale

0 Answers Avg Quality 2/10

Closely Related Answers

binary tree level traversal

Comment

    public static void levelOrderTraversal(Node root)
    {
        // base case
        if (root == null) {
            return;
        }
 
        // create an empty queue and enqueue the root node
        Queue<Node> queue = new ArrayDeque<>();
        queue.add(root);
 
        // to store the current node
        Node curr;
 
        // loop till queue is empty
        while (!queue.isEmpty())
        {
            // process each node in the queue and enqueue their
            // non-empty left and right child
            curr = queue.poll();
 
            System.out.print(curr.key + " ");
 
            if (curr.left != null) {
                queue.add(curr.left);
            }
 
            if (curr.right != null) {
                queue.add(curr.right);
            }
        }
    }

Popularity 10/10 Helpfulness 2/10 Language java

Source: www.techiedelight.com

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jan 16 2022

PrashantUnity

0 Answers Avg Quality 2/10

binary tree level order traversal

Comment

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> list = new ArrayList<>();
        Deque<TreeNode> queue = new ArrayDeque<>();
        if(root==null)
            return list;
        queue.offerLast(root);
        while(!queue.isEmpty())
        {
            ArrayList<Integer> l= new ArrayList<>();
            int size=queue.size();
            for(int i=0;i<size;i++)
            {
                TreeNode node=queue.pollFirst();
                if(node.left!=null)
                    queue.offerLast(node.left);
                if(node.right!=null)
                    queue.offerLast(node.right);
                l.add(node.val);

            }
            list.add(l);

        }

        return list;
        
        
    }
}

Popularity 9/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jun 22 2023

Zealous Zebra

0 Answers Avg Quality 2/10

level order traversal of binary tree c++

Comment

/*
node class contains:
node* left;
node* right;
int value;
*/
void levelOrder(node* root){
  node* ptr=nullptr;
  queue<node*> q;
  q.push(root);
  while(!q.empty()){
    ptr=q.front();
    cout<<ptr->value<<endl;
    if(ptr->left!=nullptr){
q.push(ptr->left);
  }
    if(ptr->right!=nullptr){
    q.push(ptr->right);
    }
    q.pop();
  }
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on May 01 2022

Shiny Spider

0 Answers Avg Quality 2/10

"Binary Tree Level Order Traversal" Algorithms

Contents

More Related Answers

"Binary Tree Level Order Traversal" Algorithms

Closely Related Answers

binary tree level traversal

binary tree level order traversal

level order traversal of binary tree c++

Grepper

Documentation

Social

Legal

Contact

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