diff --git a/include/blt/std/binary_tree.h b/include/blt/std/binary_tree.h
index db41e70..a648d1d 100644
--- a/include/blt/std/binary_tree.h
+++ b/include/blt/std/binary_tree.h
@@ -61,7 +61,7 @@ namespace blt {
                 }
             }
             
-            BST_node* search(BST_node*& parent, const T& element) {
+            BST_node* search(BST_node*& parent, const T& element) const {
                 BST_node* searchNode = m_root;
                 // basically we are iterating through the tree looking for a valid node to insert into.
                 while (true) {
@@ -146,6 +146,10 @@ namespace blt {
                 return inOrderTraverse(m_root);
             }
             
+            BST_node* debug(){
+                return m_root;
+            }
+            
             ~node_binary_search_tree() {
                 delete (m_root);
             }