Given the BinarySearchTree Class Discussed in Section 17

Given the BinarySearchTree class discussed in section 17.3 (partially shown below) , select a sequence of statements to complete the recursive postorder method. The method performs a postorder traversal of the binary search tree rooted at node n. public class BinarySearchTree
{
Private Node root;
Public BinarySearchTree() {...}
Public void postorderTraversal()
{
Postorder(root) ;
}
Private static void postorder(Node n)
{
If (n != null)
{
____________________
____________________
____________________
}
}
) . .
}

A) postorder(n.right) ;
Postorder(n.left) ;
System.out.print(n.data + " ") ;
B) postorder(n.left) ;
Postorder(n.right) ;
System.out.print(n.data + " ") ;
C) postorder(n.left) ;
System.out.print(n.data + " ") ;
Postorder(n.right) ;
D) postorder(n.right) ;
System.out.print(n.data + " ") ;
Postorder(n.left) ;