impl kpl tree test with c strings

1 files changed, 2 insertions, 2 deletions

diff --git a/include/kpl/tree.h b/include/kpl/tree.h
index 90de3a8..f3503d2 100644
--- a/include/kpl/tree.h
+++ b/include/kpl/tree.h
@@ -28,7 +28,7 @@ typedef int32_t kpl_tree_node_compare_fn(const void *node_a, const void *node_b)
 typedef void kpl_tree_node_free_fn(void *node);
 
 /*
- * KPL needs tree with insertion and find operations, deletion is not needed, all nodes are freed on tree free
+ * KPL needs trees with insertion and find operations, deletion is not needed, all nodes are freed on tree free
  */
 typedef struct {
     kpl_tree_node *root_node;
@@ -56,6 +56,6 @@ void *kpl_tree_find(kpl_tree *tree, const void *find_node);
 
 /*
  * *insert is heap allocated
- * All inserts succeed, duplicates are added to *tree_duplicate
+ * All inserts succeed, duplicates are added to *tree_duplicates
  */
 void kpl_tree_insert(kpl_tree *tree, void *insert_node);