In Java$***$ Help my create these methods for a binary search tree class:

import java.util.$*$;

public class MyNode$>\{$

MyNode rcNode;

MyNode lcNode;

T value;

ArrayList nodes $=$ new ArrayList$<>()$;

public MyNode$($T v$)\{$

value $=$ v;

$\}$

public static void view$()\{$

$//$view nodes

$\}$

$\}$

public class MyBinaryTree$>\{$

public MyBinaryTree$()\{$

$\}$

public void delete$($T value$)\{$

$\}$

private MyNode deleteOpenNode$($MyNode inNode$)\{$

$\}$

public MyNode deleteClosedNode$($MyNode inNode$)\{$

$\}$

public MyNode findNode$($T value$)\{$

$\}$

public MyNode findParent$($MyNode inNode$)\{$

$\}$

public MyNode findOpenNode$($MyNode inNode$)\{$

$\}$

public MyNode findOpenChild$($MyNode inNode$)\{$

$\}$

public String addNode$($T value$)\{$

$\}$

$\}$