CodingInterview/printTriangularTree.cpp at master · ssripadham/CodingInterview · 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
78
79
80
81
82
/*
Nodes on exterior of binary tree
*/

#include <cstdlib>
#include <iostream>

using namespace std;

struct node {
	struct node* left;
	struct node* right;
	int data;
};

struct node* insert(int data){
	struct node* newNode = (struct node*)malloc(sizeof(struct node));
	newNode->data = data;
	newNode->left = NULL;
	newNode->right = NULL;
}

bool isLeaf(struct node* root) {
	return (root->left == NULL && root->right == NULL);
}


void inOrder(struct node* root){
	if (root == NULL) return;

	inOrder(root->left);

	if (isLeaf(root))
		cout<<root->data<<" ";

	inOrder(root->right);

}

void preOrder(struct node* root){
	if (root == NULL) return;
	if (!isLeaf(root)) cout<<root->data<<" ";
	preOrder(root->left);
	//preOrder(root->right);
}


void postOrder(struct node* root){
	if (root == NULL) return;
	//postOrder(root->left);
	postOrder(root->right);
	if (!isLeaf(root)) cout<<root->data<<" ";
}


void printTriangle(struct node* root){
	preOrder(root);
	inOrder(root);
	postOrder(root);
}

int main(){

	/*
			  70

		40		   90

	20	  30    80   100

	*/

	struct node* root = insert(70);
	root->left = insert(40);
	root->left->left = insert(20);
	root->left->right = insert(30);
	root->right = insert(90);
	root->right->left = insert(80);
	root->right->right = insert(100);
	printTriangle(root);
}