-
Notifications
You must be signed in to change notification settings - Fork 0
/
BoundaryTraversal.c
87 lines (77 loc) · 1.57 KB
/
BoundaryTraversal.c
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
83
84
85
86
87
#include<stdio.h>
#include<math.h>
struct node
{
int data;
struct node *left;
struct node *right;
};
struct node* newNode(int data)
{
struct node *root = (struct node *)malloc(sizeof(struct node));
root->data = data;
root->left = NULL;
root->right = NULL;
return root;
}
void printLeftNode(struct node* root)
{
if(root)
{
if(root->left)
{
printf("%d",root->data);
printLeftNode(root->left);
}
else if(root->right)
{
printf("%d", root->data);
printLeftNode(root->right);
}
}
}
void printRightNode(struct node* root)
{
if(root)
{
if(root->right)
{
printRightNode(root->right);
printf("%d",root->data);
}
else if(root->left)
{
printRightNode(root->left);
printf("%d", root->data);
}
}
}
void printLeavesNode(struct node* root)
{
if(root)
{
printLeavesNode(root->left);
if(!(root->left) && !(root->right))
printf("%d", root->data);
printLeavesNode(root->right);
}
}
/*void printBoundary(struct node* root)
{
}*/
int main()
{
int i;
struct node* root = newNode(1);
root->left = newNode(2);
root->right = newNode(3);
root->left->left = newNode(4);
root->left->right = newNode(5);
root->right->left = newNode(6);
root->right->right = newNode(7);
printLeftNode(root);
printLeavesNode(root->left);
printLeavesNode(root->right);
printRightNode(root);
return 0;
}