_fmpz_mod_poly_tree_alloc, _fmpz_mod_poly_tree_free, _fmpz_mod_poly_tree_build
Synopsis
#include <flint/fmpz_mod_poly.h>fmpz_poly_struct ** _fmpz_mod_poly_tree_alloc(slong len)sourcevoid _fmpz_mod_poly_tree_free(fmpz_poly_struct ** tree, slong len)sourcevoid _fmpz_mod_poly_tree_build(fmpz_poly_struct ** tree, const fmpz * roots, slong len, const fmpz_mod_ctx_t ctx)sourceAllocate, free and fill a subproduct tree for len points: level 0 holds the linear factors x - r_i and each following level the products of pairs from the level below; the root (the product of all factors) is not computed.
Cite this page
The FLINT team, “_fmpz_mod_poly_tree_alloc, _fmpz_mod_poly_tree_free, _fmpz_mod_poly_tree_build (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_tree_alloc.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-tree-alloc,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_tree\_alloc, \_fmpz\_mod\_poly\_tree\_free, \_fmpz\_mod\_poly\_tree\_build (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_tree_alloc.html},
note = {Generated 2026-10-20}
}