full binary trees
Description: Full binary trees are tree data structures in which every node has either exactly two children or no children, studied in computer science and mathematics.
Wikidata ID: wiki/Q29791667
OpenAlex ID: keywords/full-binary-trees
