diff --git a/docs/smart-contracts.mdx b/docs/smart-contracts.mdx
index 9178600c0..3d6deacce 100644
--- a/docs/smart-contracts.mdx
+++ b/docs/smart-contracts.mdx
@@ -24,7 +24,7 @@ For example, it is common to create financial instruments like various *tokens*
 
 In most cases, smart contracts remove intermediates and drastically reduce costs compared to classic paper contracts and their validations.
 
-Notice that a smart contract can only run and interact with the blockchain it's stored on. It can't interact with the outside world. That's where *decentralized applications* or "dApps" come in ,because they provide interfaces for the outside world.
+Notice that a smart contract can only run and interact with the blockchain it's stored on. It can't interact with the outside world. That's where *decentralized applications* or "dApps" come in, because they provide interfaces for the outside world.
 
 ## Components of a smart contract
 
diff --git a/docs/smart-contracts/data-types/complex-data-types.md b/docs/smart-contracts/data-types/complex-data-types.md
index 8fdf031db..980254791 100644
--- a/docs/smart-contracts/data-types/complex-data-types.md
+++ b/docs/smart-contracts/data-types/complex-data-types.md
@@ -56,7 +56,7 @@ In this layout, both sides of the main pair contain a pair, then both sides of t
 
 Here is an example of a binary tree: `{{-42; "Hello"}; {True; 21}}`
 
-The binary tree layout is be more efficient than a right comb when accessing arbitrary elements.
+The binary tree layout is more efficient than a right comb when accessing arbitrary elements.
 For example, to access the last element, you can get the second element of the main pair (`{True; 21}`) and the second element of that pair (`21`).
 If the tree is balanced, the number of operations to get to any element is
 $$O(\log_2 (size))$$, whereas for a right comb, it's $$O(size)$$.