$```$

PrimitiveIntBinarySearchTree.java

$1//$ PROGRAMMER: John Doe

$//$ CLASS: PrimitiveIntBinarySearchTreeNode

$//$

$//$ CONSTRUCTORS

$//$ PrimitiveIntBinarySearchTreeNode$($element: int$)$

$//$

$//$ INSTANCE METHODS

$//$ getElement$()$: int

$//$ getLeftChild$()$: PrimitiveIntBinarySearchTreeNode

$//$ getRightChild$()$: PrimitiveIntBinarySearchTreeNode

$//$ setLeftChild$($leftChild: PrimitiveIntBinarySearchTreeNode$)$: void

$//$ setRightChild$($rightChild: PrimitiveIntBinarySearchTreeNode$)$: void

public class PrimitiveIntBinarySearchTree

$\{$

$//$ INSTANCE VARIABLES

private int size;

private PrimitiveIntBinarySearchTreeNode root;

$//$ CONSTRUCTORS

public PrimitiveIntBinarySearchTree$()$

$\{$

$\}$

$//$ INSTANCE METHODS

public boolean insert$($int element$)//$ refer to lesson notes

$\{$

$\}$

public int getSize$()$

$\{$

$\}$

private PrimitiveIntBinarySearchTreeNode getParent$($int element$)//$ refer to lesson notes

$\{$

$\}$

public void traverse$($String algorithm$)$

$\{$

switch$($algorithm$)$

$\{$

case "InOrder":

traverseIn$0$rder$($root$)$;

break;

case "Pre$0$rder":

traversePre$0$rder$($root$)$; $|$

break;

case "Post$0$rder":

traversePost$0$rder$($root$)$;

break;

default:

System.out.println$("$Invalid traversal algorithm"$)$;

$\}$

$\}$

$//$ Traverse output should be on only one line with a comma and space after each number

private void traverseInOrder$($PrimitiveIntBinarySearchTreeNode node$)$

$\{$

$\}$

$//$ Traverse output should be on only one line with a comma and space after each number

private void traversePre$0$rder$($PrimitiveIntBinarySearchTreeNode node$)$

$\{$

$\}$

$//$ Traverse output should be on only one line with a comma and space after each number

private void traversePostOrder$($PrimitiveIntBinarySearchTreeNode node$)$

$\{$

$\}$

$\}$

$```$