Scribd
Upload
12 views1 page

Java Code

The document defines a TreeNode class in Java, which represents a node in a binary tree with integer values and left/right child pointers. It also includes a BFS class that implements a breadth-first search algorithm to traverse the tree and print the values at each level. The BFS method utilizes a deque to manage the nodes at each level of the tree during traversal.

Uploaded by

dekic66784
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
12 views1 page

Java Code

The document defines a TreeNode class in Java, which represents a node in a binary tree with integer values and left/right child pointers. It also includes a BFS class that implements a breadth-first search algorithm to traverse the tree and print the values at each level. The BFS method utilizes a deque to manage the nodes at each level of the tree during traversal.

Uploaded by

dekic66784
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

// Definiton of TreeNode in Java

/*
public class TreeNode {
int val;
TreeNode left;
TreeNode right;

public TreeNode(int val) {


this.val = val;
left = null;
right = null;
}
}
*/

import java.util.ArrayDeque;
import java.util.Deque;

public class BFS {

public void bfs(TreeNode root) {


Deque<TreeNode> queue = new ArrayDeque<TreeNode>();
if (root != null) {
queue.add(root);
}
int level = 0;
while(!queue.isEmpty()) {
System.out.print("level " + level + ": ");
int levelLength = queue.size();
for (int i = 0; i < levelLength; i++) {
TreeNode curr = queue.removeFirst();
System.out.print(curr.val + " ");
if(curr.left != null) {
queue.add(curr.left);
}
if(curr.right != null) {
queue.add(curr.right);
}
}
level++;
System.out.println();
}

}
}

You might also like