Apply PR feedback

lib/runtime/storage/trie.go

@@ -210,6 +210,7 @@ func (s *TrieState) DeleteChildLimit(key []byte, limit *[]byte) (
 		// If one deletion fails, the child trie and its parent trie are then in
 		// a bad intermediary state. Take also care of the caching of deleted Merkle
 		// values within the tries, which is used for online pruning.
+		// See https://github.com/ChainSafe/gossamer/issues/3032
 		err = tr.Delete([]byte(k))
 		if err != nil {
 			return deleted, allDeleted, fmt.Errorf("deleting from child trie located at key 0x%x: %w", key, err)

lib/trie/trie.go

@@ -361,8 +361,6 @@ func (t *Trie) insert(parent *Node, key, value []byte,
 		}, mutated, nodesCreated, nil
 	}
 
-	// TODO ensure all values have dirty set to true
-
 	if parent.Kind() == node.Branch {
 		newParent, mutated, nodesCreated, err = t.insertInBranch(
 			parent, key, value, deletedMerkleValues)
@@ -888,6 +886,7 @@ func (t *Trie) clearPrefixLimitChild(branch *Node, prefix []byte, limit uint32,
 	if child == nil {
 		const valuesDeleted, nodesRemoved = 0, 0
 		// TODO ensure this is the same behaviour as in substrate
+		// See https://github.com/ChainSafe/gossamer/issues/3033
 		allDeleted = true
 		return newParent, valuesDeleted, nodesRemoved, allDeleted, nil
 	}