Highlighting does not aid memory. Questions do. But they take time. MemoryMarker turns your highlights into questions, so you can maintain traction at speed.
Specifically, it takes highlights from Omnivore and writes them as question/answer pairs to markdown files.
If we wanted to delete a node with two children, say,
6
, we replace the node with its in-order successor.
If the given tree is a balanced binary tree, the height will be in log nlog\ n, for reasons that are very similar to what we discussed in merge sort. However, it is a possibility that in the worst case, the tree provided is either left-skewed or right-skewed. In that case, the height of the tree will be in O(n) and the total work done for all the operations described above is O(n).
Q. When deleting a node with two children from a [[Min-heap]], what should replace the node?
A. The in-order successor; i.e. the node with the smallest value which is greater than the deleted node. For a binary tree, that is the smallest value in the deleted node's right subtree.
To supercharge this and remember the answers, you can ingest these questions into Anki using Memium.
-
Copy the
.env.sample
file to.env
and update the api keys -
Copy the
compose.sample.yml
file tocompose.yml
and update the output directory -
Run the container:
docker compose up
-
We use
rye
for environment management. Once it is installed, set up your virtual environment usingrye sync
. -
Make your changes.
-
Update the
.env
file with your API keys so you can run tests, or run them on CI only. -
When ready to lint, test, see the
makefile
for commands.
Documentation | |
---|---|
🔧 Installation | Installation instructions on how to install this package |
📖 Documentation | A minimal and developing documentation |
👩💻 Tutorials | Tutorials for using this package |
🎛️ API Reference | API reference for this package |
📚 FAQ | Frequently asked questions |
Type | |
---|---|
📚 FAQ | FAQ |
🚨 Bug Reports | GitHub Issue Tracker |
🎁 Feature Requests & Ideas | GitHub Issue Tracker |
👩💻 Usage Questions | GitHub Discussions |
🗯 General Discussion | GitHub Discussions |