improve docs

docs/modules/ROOT/pages/api/merkle-tree.adoc

@@ -131,7 +131,7 @@ Not all Merkle trees admit multiproofs.
 To use multiproofs, it is sufficient to ensure that:
 
 1. The tree is complete (but not necessarily perfect).
-2. The leaves to be proven are in the opposite order they are in the tree.
+2. The leaves to be proven are in the opposite order than they are in the tree.
 (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
 ====
 
@@ -182,7 +182,7 @@ Declares a commutative hash function with the following signature:
 
 `commutative_hash(a: felt252, b: felt252) -> felt252;`
 
-which computes a commutative hash of a sorted pair of `felt252`.
+which computes a commutative hash of a sorted pair of `felt252` values.
 
 This is usually implemented as an extension of a non-commutative hash function, like
 Pedersen or Poseidon, returning the hash of the concatenation of the two values by first