data-structures-and-algorithms/zig_zag.cpp at main · Open-code-source/data-structures-and-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
#include<stack>

using namespace  std;


class Node{

public:
	int data;
	Node *left,*right;
	Node(int val){
		data=val;
		left=right=NULL;
	}
};


void zig_zag(Node *root){

	if(root==NULL){
		return;
	}
	stack<Node*>  currLevel;
	stack<Node*>  nextLeve;
	bool leftToRight=true;
	currLevel.push(root);
	while(!currLevel.empty()){
		Node *temp=currLevel.top();
		currLevel.pop();

		if(temp){
			cout<<temp->data<<" ";


			if(leftToRight){

				if(temp->left){
					nextLeve.push(temp->left);
				}

				if(temp->right){
					nextLeve.push(temp->right);
				}
			}else{

				if(temp->right){
					nextLeve.push(temp->right);
				}
				if(temp->left){
					nextLeve.push(temp->left);
				}

			}
		}

		if(currLevel.empty()){
			leftToRight=!leftToRight;
			swap(currLevel,nextLeve);
		}
	}
}

int main(){


	Node *root=new Node(12);
	root->left=new Node(9);
	root->right=new Node(15);
	root->left->left=new Node(5);
	root->left->right=new Node(10);
	zig_zag(root);
	cout<<endl;


	return 0;
}