Ascent++
Search
Assertion list
binary tree
(
subgroup
of
tree
)
→ HasA
Results from
Ascent++
:
3
binary tree
→
HasA
→
n nodes
0.35
binary tree
→
HasA
→
exactly two children
0.25
binary tree
→
HasA
→
node
0.25