Java/DataStructures/Trees/LevelOrderTraversal.java at master · allensh929/Java · GitHub

History

74 lines (67 loc) · 1.72 KB

Raw

class Node

{

int data;

Node left, right;

public Node(int item)

{

data = item;

left = right = null;

}

public class LevelOrderTraversal

{

// Root of the Binary Tree

Node root;

public LevelOrderTraversal()

{

root = null;

}

/* function to print level order traversal of tree*/

void printLevelOrder()

{

int h = height(root);

int i;

for (i=1; i<=h; i++)

printGivenLevel(root, i);

}

/* Compute the "height" of a tree -- the number of

nodes along the longest path from the root node

down to the farthest leaf node.*/

int height(Node root)

{

if (root == null)

return 0;

else

{

/**

* Return the height of larger subtree

return Math.max(height(root.left),height(root.right)) + 1;

}

/* Print nodes at the given level */

void printGivenLevel (Node root ,int level)

{

if (root == null)

return;

if (level == 1)

System.out.print(root.data + " ");

else if (level > 1)

{

printGivenLevel(root.left, level-1);

printGivenLevel(root.right, level-1);

}

/* Driver program to test above functions */

public static void main(String args[])

{

LevelOrderTraversal tree = new LevelOrderTraversal();

tree.root= new Node(1);

tree.root.left= new Node(2);

tree.root.right= new Node(3);

tree.root.left.left= new Node(4);

tree.root.left.right= new Node(5);

System.out.println("Level order traversal of binary tree is ");

tree.printLevelOrder();

}

Java/DataStructures/Trees/LevelOrderTraversal.java at master · allensh929/Java · GitHub

Expand file tree

Breadcrumbs

LevelOrderTraversal.java

Latest commit

History

Breadcrumbs

LevelOrderTraversal.java

File metadata and controls