Modified the circumference program

sinagarajan · sinagarajan · commit cd93b4e827b5 · 2013-02-17T13:49:41.000+05:30
diff --git a/BinaryTreeAlgorithms/binarytree.cpp b/BinaryTreeAlgorithms/binarytree.cpp
@@ -433,6 +433,7 @@ struct tree* findLargestBSTSubtree(struct tree *root) {
   return largestBST;
 }
 
+/* Find the nodes along the circumference of the tree . Select first and last nodes in each level followed by choosing the leaf nodes at each level */
 
 void findCircumference(struct tree *root)
 {
@@ -449,6 +450,9 @@ void findCircumference(struct tree *root)
 	{
 		itr= s1.top();
 		s1.pop();
+
+		//Concept of same two stack used for zig zag traversal
+
 		if(itr->left !=NULL)
 		{
 			s2.push(itr->left);
@@ -459,9 +463,10 @@ void findCircumference(struct tree *root)
 			s2.push(itr->right);
 			++nextLevel;
 		}
-		if((itr->left == NULL && itr->right == NULL) && (count != 0) && (count != currLevel))
-			printf("\t%d", itr->data);
-		if(count == 0 || count == currLevel-1)
+
+		//Check for node at the circumference
+
+		if((itr->left == NULL && itr->right == NULL) || (count != 0) || (count != currLevel-1))
 			printf("\t%d", itr->data);
 		++count;
 		if(s1.empty())

Original file line number	Diff line number	Diff line change
`@@ -433,6 +433,7 @@ struct tree* findLargestBSTSubtree(struct tree *root) {`
`433`	`433`	`return largestBST;`
`434`	`434`	`}`
`435`	`435`
	`436`	`+/* Find the nodes along the circumference of the tree . Select first and last nodes in each level followed by choosing the leaf nodes at each level */`
`436`	`437`
`437`	`438`	`void findCircumference(struct tree *root)`
`438`	`439`	`{`
`@@ -449,6 +450,9 @@ void findCircumference(struct tree *root)`
`449`	`450`	`{`
`450`	`451`	`itr= s1.top();`
`451`	`452`	`s1.pop();`
	`453`	`+`
	`454`	`+ //Concept of same two stack used for zig zag traversal`
	`455`	`+`
`452`	`456`	`if(itr->left !=NULL)`
`453`	`457`	`{`
`454`	`458`	`s2.push(itr->left);`
`@@ -459,9 +463,10 @@ void findCircumference(struct tree *root)`
`459`	`463`	`s2.push(itr->right);`
`460`	`464`	`++nextLevel;`
`461`	`465`	`}`
`462`		`- if((itr->left == NULL && itr->right == NULL) && (count != 0) && (count != currLevel))`
`463`		`- printf("\t%d", itr->data);`
`464`		`- if(count == 0 \|\| count == currLevel-1)`
	`466`	`+`
	`467`	`+ //Check for node at the circumference`
	`468`	`+`
	`469`	`+ if((itr->left == NULL && itr->right == NULL) \|\| (count != 0) \|\| (count != currLevel-1))`
`465`	`470`	`printf("\t%d", itr->data);`
`466`	`471`	`++count;`
`467`	`472`	`if(s1.empty())`