Update 020 Construct Linked List for Each Level.cpp

Author: maityamit

009 - Binary Trees/020 Construct Linked List for Each Level.cpp

@@ -1,5 +1,37 @@
+/**********************************************************
+
+	Following are the Binary Tree Node class structure and
+	the Node class structure
+
+	template <typename T>
+	class BinaryTreeNode {
+    	public: 
+    	T data;
+    	BinaryTreeNode<T> *left;
+    	BinaryTreeNode<T> *right;
+
+    	BinaryTreeNode(T data) {
+        	this->data = data;
+        	left = NULL;
+        	right = NULL;
+    	}
+	};
+
+	template <typename T>
+	class Node {
+		public:
+    	T data;
+    	Node<T> *next;
+    	Node(T data) {
+        	this->data=data;
+        	this->next=NULL;
+    	}
+	};
+
+***********************************************************/
 vector<Node<int>*> constructLinkedListForEachLevel(BinaryTreeNode<int> *root) {
-	 vector<Node<int>*> vt;
+    
+    vector<Node<int>*> vt;
     if(root==NULL){
         vt.push_back(NULL);
         return vt;
@@ -12,31 +44,35 @@ vector<Node<int>*> constructLinkedListForEachLevel(BinaryTreeNode<int> *root) {
 	while(qu.size()!=0){
 		BinaryTreeNode<int>* temp = qu.front();
 		qu.pop();
-		if(temp!=NULL){
-			Node<int>* tempu = new Node<int>(temp->data);
-			if(start==NULL){
-				start=tempu;
-                vt.push_back(start);
-				end=tempu;
-			}else{
-				end->next=tempu;
-				end=end->next;
-			}
-			if(temp->left!=NULL){
-				qu.push(temp->left);
-			}
-			if(temp->right!=NULL){
-				qu.push(temp->right);
-			}
-		}else{
-            end->next=NULL;
-			if(qu.size()==0){
-				break;
-			}
-			qu.push(NULL);
-			start=NULL;
-			end=NULL;
-		}
+		
+        if(temp!=NULL){
+            Node<int>* amit = new Node<int>(temp->data);
+            if(start==NULL){
+                start=amit;
+                end=amit;
+            }else{
+                end->next=amit;
+                end=end->next;
+            }
+            
+            if(temp->left){
+                qu.push(temp->left);
+            }
+            if(temp->right){
+                qu.push(temp->right);
+            }
+            
+        }else{
+            vt.push_back(start);
+            if(qu.size()==0){
+                return vt;
+            }
+            start=NULL;
+            end=NULL;
+            qu.push(NULL);
+        }
 	}
 	return vt;
+    
+    
 }