## Tree traversal functions

parent | return parent of <parameter>n</parameter>
daughter1 | return first daughter of <parameter>n</parameter>
daughter2 | return second daughter of <parameter>n</parameter>
daughtern | return nth daughter of <parameter>n</parameter>
daughtern | return last daughter of <parameter>n</parameter>
next_sibling | return next sibling (sister) of <parameter>n</parameter>
prev_sibling | return previous sibling (sister) of <parameter>n</parameter>
root | return root node of treeprevious sibling (sister) of <parameter>n</parameter>
parent | return parent of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
daughter1 | return first daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
daughter2 | return second daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
daughtern | return last daughter of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
next_sibling | return next sibling (sister) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
prev_sibling | return previous sibling (sistem) of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
root | return root of tree of <parameter>n</parameter> as seen from relation <parameter>relname</parameter>
first_leaf | return the first leaf (terminal node) which is dominated by <parameter>n</parameter>.
last_leaf | return the last leaf (terminal node) which is dominated by <parameter>n</parameter>.
next_leaf | Return next leaf in tree given <parameter>n</parameter>.
num_leaves | Return number of leaves (terminal nodes) under <parameter>n</parameter>
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