Assume you have a JAVA Tree with the following node:

class node {

node left;

node right;

int data; }

Also assume that you have a method defined (header shown below) which securely deletes data (overwrites it to prevent other processes from getting at the information) this method takes a node reference and returns nothing (void); assume it has already been tested and works. You need to write a recursive method that will traverse a tree and process each node (by process, I mean calling SecureWipe for the erase).

[public static void SecureWipe (node target)] HINTS: Think first about the simplest tree case; focus on the ORDER that the processing needs to occur