logo CodeStepByStep logo

removeLeaves

Language/Type: C++ binary trees pointers recursion
Related Links:
Author: Marty Stepp (on 2016/08/27)

Write a function named removeLeaves that accepts a reference to a pointer to the root of a binary tree of integers. Your function should remove the leaf nodes from a tree. A leaf is a node that has empty (NULL) left and right subtrees. If your function is called on an empty tree, it does not change the tree because there are no nodes of any kind (leaf or not). Free the memory for any removed nodes.

Constraints: Do not construct any new BinaryTreeNode objects in solving this problem (though you may create as many BinaryTreeNode* pointer variables as you like). Do not use any auxiliary data structures to solve this problem (no array, vector, stack, queue, string, etc).

Assume that you are using the BinaryTreeNode structure as defined below:

struct BinaryTreeNode {
    int data;
    BinaryTreeNode* left;
    BinaryTreeNode* right;
    ...
}
Type your C++ solution code here:


This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.