Function check_tree_order

fn check_tree_order(items: &[SolutionItem]) -> bool

Check tree ordering recursively.

HashX uses a lexicographic ordering constraint applied at each tree level, to resolve the ambiguity that would otherwise be present between each pair of branches in the item tree.

When combined with the hash sum constraints, this fully constrains the order of the items in a solution. On its own this constraint only partially defines the order of the entire item array.