fix(docs): Fix broken link in tree implementations page (AztecProtoco…

…l#6143)

- Fixes a broken hard coded link
- Fixes a small spelling error

docs/docs/protocol-specs/state/public-data-tree.md

@@ -2,7 +2,7 @@
 
 The Public Data tree is an [indexed Merkle tree](./tree-implementations.md#indexed-merkle-trees) that stores public-state. Each item stored in the tree is a key-value pair, where both key and value are 254-bit altBN-254 scalar field elements. Items are sorted based on their key, so each indexed tree leaf contains a tuple with the key, the value, the next-highest key, and the index in the tree for the next-highest key. This tree is part of the global state, and is updated by the sequencer during the execution of public functions.
 
-An indexed Merkle tree is ued instead of a sparse Merkle tree in order to reduce the tree height. A lower height means shorter membership proofs.
+An indexed Merkle tree is used instead of a sparse Merkle tree in order to reduce the tree height. A lower height means shorter membership proofs.
 
 Keys in the Public Data tree are [siloed](./tree-implementations.md#siloing-leaves) using the contract address, to prevent a contract from overwriting the public state of another contract.
 

docs/docs/protocol-specs/state/tree-implementations.md

@@ -14,7 +14,7 @@ Indexed Merkle trees, introduced [here](https://eprint.iacr.org/2021/1263.pdf),
 
 With an Indexed Merkle tree, proving non-membership of a value `x` then requires a membership proof of the node with value lower than `x` and a next-highest value greater than `x`. The cost of this proof is proportional to the height of the tree, which can be set according to the expected number of elements to be stored in the tree. For comparison, a non-membership proof in a sparse tree requires a tree with height proportional to the size of the elements, so when working with 256-bit elements, 256 hashes are required for a proof.
 
-Refer to [this page](https://docs.aztec.network/concepts/advanced/data_structures/indexed_merkle_tree) for more details on how insertions, updates, and membership proofs are executed on an Indexed Merkle tree.
+Refer to [this page](../../learn/concepts/storage/trees/indexed_merkle_tree.md) for more details on how insertions, updates, and membership proofs are executed on an Indexed Merkle tree.
 
 <!-- Q: should we embed the diagrams and pseudocode here, instead of linking? -->