Function lks_tap_tree

pub fn lks_tap_tree<C: PointHandler + 'static>(
    point: &dyn Point,
    cb: C,
    on_missing: Option<OnMissing>,
    span: Option<Span>,
) -> LkResult<i64>

First does a scan_tree and saves all missing hashes Then starts watching for any hash that was missing, and recursivly doing a scan_tree + saving missing hashes whenever a match is found note that on_missing is called per point, but PointHandler.on_point is only called once even it is linked multiple times