5.3: Final word

A Cool Brisk Walk Through Discrete Mathematics · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under not declared, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    Whew, that was a lot of information about structures. Before we continue our walk in the next chapter with a completely different topic, I’ll leave you with this summary thought. Let \(BST\) be the set of Binary Search Trees, and \(BT\) be the set of Binary Trees. Let \(RT\) be the set of rooted trees, and \(T\) be the set of trees (free or rooted). Finally, let \(CG\) be the set of connected graphs, and \(G\) the set of all graphs. Then we have:

    \[BST \subset BT \subset RT \subset T \subset CG \subset G.\]

    It’s a beautiful thing.

    This page titled 5.3: Final word was last modified on Tue, 01 Sep 2026 03:35:11 GMT and is shared under a not declared license and was authored, remixed, and/or curated by Stephen Davies (allthemath.org) via source content that was edited to the style and standards of the LibreTexts platform.