<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Tree (graph theory) - Page 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Tree_(graph_theory)&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree_%28graph_theory%29&amp;p=17">3.Next</a>
</p>
<p>a vertex  is any vertex that is either the parent of  or is (recursively) an ascendant of a parent of . A descendant of a vertex  is any vertex that is either a child of  or is (recursively) a descendant of a child of . A sibling to a vertex  is any other vertex on the tree that shares a parent with . A leaf is a vertex with no children. An internal vertex is a vertex that is not a leaf.</p>

<p>The height of a vertex in a rooted tree is the length of the longest downward path to a leaf from that vertex. The height of the tree is the height of</p><p>
<a accesskey="1" href="page.php?w=Tree_(graph_theory)&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree_%28graph_theory%29&amp;p=17">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
