从我的二叉搜索树中删除节点时遇到困难

I am creating a binary search tree that needs to be able to delete a node and return true if the node was properly deleted, or false if the value doesn't exist in the tree. I am doing this because I need to delete more than one number and I want to create a while loop to delete all of it while it is true. For example one tree has the following ints: {79, 83, 147, 71, 95, 49, 15, 191}. Another tree has the following ints {26, 79, 144, 88, 147, 200, 90 }. My task is to find any elements that are in tree 1 that are in tree 2 and delete them from tree 1 (In this case 79 and 147). I am wanting to create a loop that runs through all the numbers in tree 2 and search and delete from tree one. Here is what I have so far for the remove node function(Assuming the trees are already built and filled):I am creating a binary search tree that needs t