From bebc87e2f0df5eb03840840b8e15012cfe6d6b71 Mon Sep 17 00:00:00 2001
From: Daniel Liu <139250065@qq.com>
Date: Tue, 17 Jun 2025 13:25:40 +0800
Subject: [PATCH] trie: fix typos (#1080)

---
 trie/iterator.go | 2 +-
 trie/sync.go     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/trie/iterator.go b/trie/iterator.go
index 13457e4d84..90ed869bf7 100644
--- a/trie/iterator.go
+++ b/trie/iterator.go
@@ -274,7 +274,7 @@ func (it *nodeIterator) seek(prefix []byte) error {
 	}
 }
 
-// init initializes the the iterator.
+// init initializes the iterator.
 func (it *nodeIterator) init() (*nodeIteratorState, error) {
 	root := it.trie.Hash()
 	state := &nodeIteratorState{node: it.trie.root, index: -1}
diff --git a/trie/sync.go b/trie/sync.go
index 38ce3a1ab0..d70af32497 100644
--- a/trie/sync.go
+++ b/trie/sync.go
@@ -198,7 +198,7 @@ func (s *Sync) AddCodeEntry(hash common.Hash, path []byte, parent common.Hash) {
 func (s *Sync) Missing(max int) []common.Hash {
 	var requests []common.Hash
 	for !s.queue.Empty() && (max == 0 || len(requests) < max) {
-		// Retrieve th enext item in line
+		// Retrieve the next item in line
 		item, prio := s.queue.Peek()
 
 		// If we have too many already-pending tasks for this depth, throttle