level order tree traversal

Author: rahulk31

Trees/level-order-traversal.cpp

@@ -0,0 +1,61 @@
+/* C++ program to print level order traversal using STL */
+#include <bits/stdc++.h> 
+using namespace std; 
+
+// A Binary Tree Node 
+struct Node 
+{ 
+	int data; 
+	struct Node *left, *right; 
+}; 
+
+// Iterative method to find height of Binary Tree 
+void printLevelOrder(Node *root) 
+{ 
+	// Base Case 
+	if (root == NULL) return; 
+
+	// Create an empty queue for level order traversal 
+	queue<Node *> q; 
+
+	// Enqueue Root and initialize height 
+	q.push(root); 
+
+	while (q.empty() == false) 
+	{ 
+		// Print front of queue and remove it from queue 
+		Node *node = q.front(); 
+		cout << node->data << " "; 
+		q.pop(); 
+
+		/* Enqueue left child */
+		if (node->left != NULL) 
+			q.push(node->left); 
+
+		/*Enqueue right child */
+		if (node->right != NULL) 
+			q.push(node->right); 
+	} 
+} 
+
+// create a new tree node 
+Node* newNode(int data) 
+{ 
+	Node *temp = new Node; 
+	temp->data = data; 
+	temp->left = temp->right = NULL; 
+	return temp; 
+} 
+
+int main() 
+{ 
+	Node *root = newNode(1); 
+	root->left = newNode(2); 
+	root->right = newNode(3); 
+	root->left->left = newNode(4); 
+	root->left->right = newNode(5); 
+
+	cout << "Level Order traversal of binary tree is \n"; 
+	printLevelOrder(root); 
+	return 0; 
+}