benchmarks.wiki

benchmarks.wiki / Public workspace

BoolQ / can a node in a tree have two parents

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

can a node in a tree have two parents
passage · full text (384 characters)
This data structure defines a directed graph, and for it to be a tree one must add a condition on its global structure (its topology), namely that at most one reference can point to any given node (a node has at most a single parent), and no node in the tree point to the root. In fact, every node (other than the root) must have exactly one parent, and the root must have no parents.

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

task_id
2821b06e-83c4-56c9-a001-7193d93249dd
task_key
default--validation--2821b06e-83c4-56c9-a001-7193d93249dd
task_revision_id
1
config / split
default / validation

Official source

initial import