Postprocessor that makes a noisy b-ary tree internally consistent, and returns the leaf layer.
Details
The input argument of the function is a balanced b
-ary tree implicitly stored in breadth-first order
Tree is assumed to be complete, as in, all leaves on the last layer are on the left.
Non-existent leaves are assumed to be zero.
The output remains consistent even when leaf nodes are missing. This is due to an adjustment to the original algorithm to apportion corrections to children relative to their variance.
make_consistent_b_ary_tree in Rust documentation.
Citations:
Supporting Elements:
Input Type:
Vec<TIA>
Output Type:
Vec<TOA>