Hello Good People
I am trying to learn Rust.
The hard way.
I have read The Rust Book now (excellent book, so a tick for RTFM for me!).
I have decided to write a simple in-memory B-Tree Index library - since my background is relational databases so I do know how B-Tree works well enough (and happy to use recursion).
I would like some general direction/approach advice re doing in the Rust idiomatic way.
I am aware of Box, Rc, RcMut and RefCell.
Given the index nodes need to be mutable and owned and manipulated in a graph-like-way (to insert/update/remove/re-balance node key contents), I would like opinions of which Rust features/structs/etc to use to implement this data structure in-memory.
I will get to on-disk persistence/serialization later, I am sure this will be another huge task to get it written in Rust idiomatic way.
Any advice appreciated from a new Rust student!
Many thanks in advance!