use v6-alpha;
use Test;
use v6;
use Test;
plan 1;

# P72 (*) Construct the bottom-up order sequence of the tree nodes
# 
# Write a predicate bottom-up(Tree,Seq) which constructs the bottom-up sequence
# of the nodes of the multiway tree Tree. Seq should be a Prolog list. What
# happens if you run your predicate backwords?

if 1 {
    skip 1, "Test(s) not yet written: (*) Construct the bottom-up order sequence of the tree nodes";
}
else {
    ok 1, '(*) Construct the bottom-up order sequence of the tree nodes';
}
