Tree traversal functions

o parent
return parent of <parameter>n</parameter>
o daughter1
return first daughter of <parameter>n</parameter>
o daughter2
return second daughter of <parameter>n</parameter>
o daughtern
return nth daughter of <parameter>n</parameter>
o daughtern
return last daughter of <parameter>n</parameter>
o next_sibling
return next sibling (sister) of <parameter>n</parameter>
o prev_sibling
return previous sibling (sister) of <parameter>n</parameter>
o root
return root node of treeprevious sibling (sister) of <parameter>n</parameter>
o parent
return parent of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o daughter1
return first daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o daughter2
return second daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o daughtern
return last daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o next_sibling
return next sibling (sister) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o prev_sibling
return previous sibling (sistem) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o root
return root of tree of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
o first_leaf
return the first leaf (terminal node) which is dominated by <parameter>n</parameter>.
o last_leaf
return the last leaf (terminal node) which is dominated by <parameter>n</parameter>.
o next_leaf
Return next leaf in tree given <parameter>n</parameter>.
o num_leaves
Return number of leaves (terminal nodes) under <parameter>n</parameter>
o in_tree
Given a node <parameter>t</parameter>, return true if <parameter>c</parameter> is under it in a tree

Alphabetic index Hierarchy of classes

This page is part of the Edinburgh Speech Tools Library documentation
Copyright University of Edinburgh 1997
Contact: speech_tools@cstr.ed.ac.uk