From 8e89a76e7798e21ea867395dad05c3a72e1d36da Mon Sep 17 00:00:00 2001
From: Raphael Roberts <raphael.roberts48@gmail.com>
Date: Mon, 11 Nov 2019 12:29:57 -0600
Subject: [PATCH] Got rid of todos

---
 BST.java | 2 --
 1 file changed, 2 deletions(-)

diff --git a/BST.java b/BST.java
index f6ed692..a064fbe 100644
--- a/BST.java
+++ b/BST.java
@@ -63,7 +63,6 @@ public class BST {
     // This non-recursive method returns a string that represents the in-order traversal
     // of the binary search tree.
     public String inOrder() {
-        // TODO: implement this method using a non-recursive solution
         String return_string = "";
         Stack<BSTNode> stack = new Stack<BSTNode>();
         BSTNode current = m_root;
@@ -92,7 +91,6 @@ public class BST {
     // This method takes a reference to the root of the expression, evaluates
     // the tree, and returns the result as an int.
     public int evaluate(BSTNode node) {
-        // TODO: implement this method using a non-recursive solution
         return -1; // replace this statement with your own return
     }
 }