New line BFS

Author: manosriram

Trees/Binary_Tree/BFS_newLines.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <queue>
+#include "createDefaultTree.hpp"
+#include "basicTreeTemplate.h"
+using namespace std;
+
+void BFSNL(BNode *root) {
+ queue<BNode *> q;
+ q.push(root);
+ int ct = q.size();
+ while (!q.empty()) {
+ while (ct--) {
+ BNode *now = q.front();
+ cout << now->data << " ";
+ q.pop();
+
+ if (now->left) q.push(now->left);
+ if (now->right) q.push(now->right);
+ }
+
+ ct = q.size();
+ cout << endl;
+ }
+}
+
+int main() {
+ BNode *root = createDefaultTree();
+
+ BFSNL(root);
+}
+

Trees/Binary_Tree/a.out

@@ -1,3 +1,5 @@
+#pragma once
+
 #include <iostream>
 #include <stack>
 #include <queue>
@@ -72,4 +74,4 @@ void postOrderTraversalRecursive(BNode *root) {
  postOrderTraversalRecursive(root->right);
  cout << root->data << " ";
  return;
-}
+}

Trees/Binary_Tree/basicTreeTemplate.h

@@ -0,0 +1,17 @@
+#include <iostream>
+#include "basicTreeTemplate.h"
+#include <queue>
+using namespace std;
+
+BNode *createDefaultTree() {
+ BNode *root = new BNode();
+ root = createNode(1);
+ root->left = createNode(2);
+ root->right = createNode(3);
+ root->left->left = createNode(4);
+ root->left->right = createNode(5);
+ root->right->left = createNode(6);
+ root->right->right = createNode(7);
+
+ return root;
+}