1
0
mirror of https://github.com/bitcoin/bips.git synced 2026-05-18 16:59:30 +00:00

BIP3,37,39,42,52,62: fix typos (#1824)

Co-authored-by: Mark "Murch" Erhardt <murch@murch.one>
This commit is contained in:
wgyt
2025-04-14 23:22:17 +08:00
committed by GitHub
parent 4b568f2c37
commit befa252b51
6 changed files with 7 additions and 7 deletions

View File

@@ -159,7 +159,7 @@ A ''Merkle tree'' is a way of arranging a set of items as leaf nodes of tree in
** Check whether this node corresponds to a leaf node (transaction) that is to be included OR any parent thereof:
*** If so, append a '1' bit to the flag bits
*** Otherwise, append a '0' bit.
** Check whether this node is a internal node (non-leaf) AND is the parent of an included leaf node:
** Check whether this node is an internal node (non-leaf) AND is the parent of an included leaf node:
*** If so:
**** Descend into its left child node, and process the subtree beneath it entirely (depth-first).
**** If this node has a right child node too, descend into it as well.