<s>[INST] This problem has multiple parts. We are given a binary tree where each node is a struct with at least the following attributes: 'value', 'left' and 'right'. The problem is to remove all nodes in the tree that have exactly two children and then return the resulting tree.[/INST]