PQ tree
id:
pq-tree-272-8956417
title:
PQ tree
text:
A PQ tree is a tree-based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by one of the leaf nodes, and each non-leaf node is labelled P or Q. A P node has at least two children, and a Q node has at least three children. A PQ tree represents its permutations via permissible reorderings of the children of its nodes. The children of
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/PQ_tree
date created:
date modified:
2023-12-19T13:16:14Z
main entity:
{"identifier":"Q4046245","url":"https://www.wikidata.org/entity/Q4046245"}
image:
fields total:
13
integrity:
13