Index: generic/src/adt/btree.c
===================================================================
--- generic/src/adt/btree.c	(revision b26db0c082ac541c4209463c1089b751d58cefde)
+++ generic/src/adt/btree.c	(revision c47912f7cc3fc6625772f9dd1370d20d9bb36539)
@@ -341,12 +341,12 @@
 }
 
-/** Return pointer to B-tree node's left sibling.
+/** Return pointer to B-tree leaf node's left neighbour.
  *
  * @param t B-tree.
- * @param node Node whose left sibling will be returned.
- *
- * @return Left sibling of the node or NULL if the node does not have the left sibling.
- */
-btree_node_t *btree_node_left_sibling(btree_t *t, btree_node_t *node)
+ * @param node Node whose left neighbour will be returned.
+ *
+ * @return Left neighbour of the node or NULL if the node does not have the left neighbour.
+ */
+btree_node_t *btree_leaf_node_left_neighbour(btree_t *t, btree_node_t *node)
 {
 	ASSERT(LEAF_NODE(node));
@@ -357,12 +357,12 @@
 }
 
-/** Return pointer to B-tree node's right sibling.
+/** Return pointer to B-tree leaf node's right neighbour.
  *
  * @param t B-tree.
- * @param node Node whose right sibling will be returned.
- *
- * @return Right sibling of the node or NULL if the node does not have the right sibling.
- */
-btree_node_t *btree_node_right_sibling(btree_t *t, btree_node_t *node)
+ * @param node Node whose right neighbour will be returned.
+ *
+ * @return Right neighbour of the node or NULL if the node does not have the right neighbour.
+ */
+btree_node_t *btree_leaf_node_right_neighbour(btree_t *t, btree_node_t *node)
 {
 	ASSERT(LEAF_NODE(node));