-
Notifications
You must be signed in to change notification settings - Fork 0
/
1325 Delete Leaves with a given value.c
105 lines (94 loc) · 2.43 KB
/
1325 Delete Leaves with a given value.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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode* preorder(struct TreeNode * root, int target, struct TreeNode * parent, bool left)
{
if(root == NULL)
return;
if(root->val == target)
{
if((root->left == NULL) && (root->right == NULL)) //Leaf Node
{
if((left == true) && parent)
{
parent->left = NULL;
free(root);
return NULL;
}
else if((left == false) && parent)
{
parent->right = NULL;
free(root);
return NULL;
}
else if(!parent)
{
free(root);
root = NULL;
return root;
}
}
}
preorder(root->left, target, root, true);
if(root->val == target)
{
if((root->left == NULL) && (root->right == NULL)) //Leaf Node
{
if((left == true) && parent)
{
parent->left = NULL;
free(root);
return NULL;
}
else if((left == false) && parent)
{
parent->right = NULL;
free(root);
return NULL;
}
else if(!parent)
{
free(root);
root = NULL;
return root;
}
}
}
preorder(root->right, target, root, false);
if(root->val == target)
{
if((root->left == NULL) && (root->right == NULL)) //Leaf Node
{
if((left == true) && parent)
{
parent->left = NULL;
free(root);
return NULL;
}
else if((left == false) && parent)
{
parent->right = NULL;
free(root);
return NULL;
}
else if(!parent) //Root node is to be deleted
{
free(root);
root = NULL;
return root;
}
}
}
return root;
}
struct TreeNode* removeLeafNodes(struct TreeNode* root, int target)
{
struct TreeNode * parent = NULL;
root = preorder(root, target, parent, false);
return root;
}