update: add traversePostOrder

BinaryTree.java

@@ -7,6 +7,10 @@ public class BinaryTree {
     insert(content);
   }
 
+  public Node getRoot() {
+    return rootNode;
+  }
+
   public boolean search(int value) {
      if (rootNode == null) {
        return false;
@@ -120,6 +124,14 @@ public class BinaryTree {
     }
   }
 
+  public void traversePostOrder(Node node) {
+    if (node != null) {
+      traversePostOrder(node.getLeftNode());
+      traversePostOrder(node.getRightNode());
+      System.out.print(" " + node.getContent());
+    }
+  }
+
   // Print functions from https://www.baeldung.com/java-print-binary-tree-diagram
   // public void print() {
   //   StringBuilder sb = new StringBuilder();

Main.java

@@ -1,30 +1,30 @@
 public class Main {
     public static void main(String[] args) {
-        BinaryTree binaryTree = new BinaryTree(23);
-        binaryTree.insert(42);
-        binaryTree.insert(23);
-        binaryTree.insert(22);
-        binaryTree.insert(23);
-        binaryTree.insert(55);
-        binaryTree.insert(72);
+        BinaryTree binaryTree = new BinaryTree(5);
+        binaryTree.insert(2);
         binaryTree.insert(1);
-        binaryTree.insert(7);
+        binaryTree.insert(4);
         binaryTree.insert(3);
-        binaryTree.insert(8);
+        binaryTree.insert(9);
+        binaryTree.insert(6);
+        binaryTree.insert(15);
+        binaryTree.insert(11);
+        binaryTree.insert(10);
+        binaryTree.insert(13);
         binaryTree.insert(16);
 
-        binaryTree.print();
+        //binaryTree.print();
 
-        System.out.println(binaryTree.search(42));
+        // System.out.println(binaryTree.search(42));
         // Test values not in tree
-        System.out.println(binaryTree.search(2));
+        // System.out.println(binaryTree.search(2));
 
-        binaryTree.remove(23);
-        binaryTree.remove(1);
-        binaryTree.remove(9);
-        binaryTree.remove(72);
-        binaryTree.remove(42);
+        // binaryTree.remove(23);
+        // binaryTree.remove(1);
+        // binaryTree.remove(9);
+        // binaryTree.remove(72);
+        // binaryTree.remove(42);
 
-        
+        binaryTree.traversePostOrder(binaryTree.getRoot());
     }
 }