Something

package PA4;public class BinaryTree {		Node root;		public BinaryTree() {			}		public BinaryTree(Node root) {		this.setRoot(root);	}	public Node getRoot() {		return root;	}	public void setRoot(Node root) {		this.root = root;	}		public Node search() {			}		public void insert() {			}		// Calls one of the private traversal methods depending on argument		public void traverse(String traverseType) {		if (traverseType.equalsIgnoreCase("In-order")) {			this.inOrderTraverse(this.getRoot());		} else if (traverseType.equalsIgnoreCase("Pre-order")) {			this.preOrderTraverse(this.getRoot());		} else if (traverseType.equalsIgnoreCase("Post-order")) {			this.postOrderTraverse(this.getRoot());		} else {			System.out.print("Command not found");		}	}		private void inOrderTraverse(Node node) {		if (node == null) {			return;		} else {			inOrderTraverse(node.getLeft());			System.out.print(node.getIdentifier() + "\b");			inOrderTraverse(node.getRight());		}	}		private void preOrderTraverse(Node node) {		if (node == null) {			return;		} else {			System.out.print(node.getIdentifier() + "\b");			inOrderTraverse(node.getLeft());			inOrderTraverse(node.getRight());		}	}		private void postOrderTraverse(Node node) {		if (node == null) {			return;		} else {			inOrderTraverse(node.getLeft());			inOrderTraverse(node.getRight());			System.out.print(node.getIdentifier() + "\b");		}	}}