Deleting all Leaves from a Binary Tree - Binary Tree Problems

Deleting all Leaves from a Binary Tree - Binary Tree Problems

Solution: By using post-order traversal we can solve this problem (other traversals would also work).

01	struct BinaryTreeNode* removeLeaves(struct BinaryTreeNode* root) {

02	if (root != NULL)

03

{

04	if (root->left == NULL && root->right == NULL)

05

{

06	free(root);

07	return NULL;

08

}

09

else

10

{

11	root->left = removeLeaves(root->left);

12	root->right = removeLeaves(root->right);

13

}

14

}

15	return root;

16

}

Time Complexity: O(n). Where is numbe of nodes in tree.

Read full article from Deleting all Leaves from a Binary Tree - Binary Tree Problems