Tress and Catalan Numbers
This chapter presents delightful occurrences of Catalan numbers in the theory of trees. They include binary trees, full binary trees, planted trivalent binary trees, triangulations and prefix expressions, chessboard, ordered rooted trees, forest, and ordered forests.
Keywords: connected graph, forest, binary tree, full binary tree, planted trivalent binary tree, prefix expression, chessboard, Catalan triangle, Bernhard's algorithm
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .