Index: kernel/generic/src/adt/btree.c
===================================================================
--- kernel/generic/src/adt/btree.c	(revision 818fffee39e7af9d4be402c0bbf35d4a06b82d6c)
+++ kernel/generic/src/adt/btree.c	(revision 40cdbecbb00c24e72ac96b7b0350aa443cd5853e)
@@ -38,9 +38,9 @@
  *
  * The B+tree has the following properties:
- * @li it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5)
+ * @li it is a balanced 3-4-5 tree (i.e. BTREE_M = 5)
  * @li values (i.e. pointers to values) are stored only in leaves
  * @li leaves are linked in a list
  *
- * Be carefull when using these trees. They need to allocate
+ * Be careful when using these trees. They need to allocate
  * and deallocate memory for their index nodes and as such
  * can sleep.
@@ -146,5 +146,5 @@
  * also makes use of this feature.
  *
- * @param node     B-tree node into wich the new key is to be inserted.
+ * @param node     B-tree node into which the new key is to be inserted.
  * @param key      The key to be inserted.
  * @param value    Pointer to value to be inserted.
@@ -270,5 +270,5 @@
  * This feature is used during insert by right rotation.
  *
- * @param node     B-tree node into wich the new key is to be inserted.
+ * @param node     B-tree node into which the new key is to be inserted.
  * @param key      The key to be inserted.
  * @param value    Pointer to value to be inserted.
@@ -463,5 +463,5 @@
 	if (rnode->keys < BTREE_MAX_KEYS) {
 		/*
-		 * The rotaion can be done. The right sibling has free space.
+		 * The rotation can be done. The right sibling has free space.
 		 */
 		node_insert_key_and_rsubtree(node, inskey, insvalue, rsubtree);
@@ -484,5 +484,5 @@
  * the median will be copied there.
  *
- * @param node     B-tree node wich is going to be split.
+ * @param node     B-tree node which is going to be split.
  * @param key      The key to be inserted.
  * @param value    Pointer to the value to be inserted.
@@ -562,5 +562,5 @@
 	if (node->keys < BTREE_MAX_KEYS) {
 		/*
-		 * Node conatins enough space, the key can be stored immediately.
+		 * Node contains enough space, the key can be stored immediately.
 		 */
 		node_insert_key_and_rsubtree(node, key, value, rsubtree);
@@ -806,5 +806,5 @@
 		
 		/*
-		 * The key can be immediatelly removed.
+		 * The key can be immediately removed.
 		 *
 		 * Note that the right subtree is removed because when
Index: kernel/generic/src/adt/list.c
===================================================================
--- kernel/generic/src/adt/list.c	(revision 818fffee39e7af9d4be402c0bbf35d4a06b82d6c)
+++ kernel/generic/src/adt/list.c	(revision 40cdbecbb00c24e72ac96b7b0350aa443cd5853e)
@@ -33,5 +33,5 @@
 /**
  * @file
- * @brief	Functions completing doubly linked circular list implementaion.
+ * @brief	Functions completing doubly linked circular list implementation.
  *
  * This file contains some of the functions implementing doubly linked circular lists.