2 files changed, 10 insertions, 10 deletions
diff --git a/src/tree.c b/src/tree.c
index 6a0f1a1..aa99399 100644
--- a/src/tree.c
+++ b/src/tree.c
@@ -30,19 +30,19 @@
 #define MIN(a, b) (((a) < (b)) ? (a) : (b))
 #define MAX(a, b) (((a) > (b)) ? (a) : (b))
 
-struct _ZixTree {
+struct ZixTreeImpl {
 	ZixTreeNode*  root;
 	ZixComparator cmp;
 	void*         cmp_data;
 	bool          allow_duplicates;
 };
 
-struct _ZixTreeNode {
-	const void*          data;
-	struct _ZixTreeNode* left;
-	struct _ZixTreeNode* right;
-	struct _ZixTreeNode* parent;
-	int_fast8_t          balance;
+struct ZixTreeNodeImpl {
+	const void*             data;
+	struct ZixTreeNodeImpl* left;
+	struct ZixTreeNodeImpl* right;
+	struct ZixTreeNodeImpl* parent;
+	int_fast8_t             balance;
 };
 
 #ifdef ZIX_TREE_DUMP
@@ -73,7 +73,7 @@ ZIX_API
 ZixTree*
 zix_tree_new(bool allow_duplicates, ZixComparator cmp, void* cmp_data)
 {
-	ZixTree* t = malloc(sizeof(struct _ZixTree));
+	ZixTree* t = malloc(sizeof(ZixTree));
 	t->root             = NULL;
 	t->cmp              = cmp;
 	t->cmp_data         = cmp_data;
diff --git a/zix/tree.h b/zix/tree.h
index db628a6..8639d25 100644
--- a/zix/tree.h
+++ b/zix/tree.h
@@ -40,12 +40,12 @@ typedef int (*ZixComparator)(const void* a, const void* b, void* user_data);
 /**
    A balanced binary search tree.
 */
-typedef struct _ZixTree ZixTree;
+typedef struct ZixTreeImpl ZixTree;
 
 /**
    A node in a @ref ZixTree.
 */
-typedef struct _ZixTreeNode ZixTreeNode;
+typedef struct ZixTreeNodeImpl ZixTreeNode;
 
 /**
    An iterator over a @ref ZixTree.