Trees

Published

2023-08-05

Three videos on trees and their properties (7:19, 7:55 and 9:30). The first two cover definitions: nodes, edges, connectedness, paths, leaves, interior nodes, height, degree, roots and rooted trees, binary trees, etc.—cool stuff. The third gives some applications of trees: tournament brackets, organizational trees, bills of material and assembly trees, linguistic parse trees, phylogenetic trees, parse trees for context free grammars, expression trees, and abstract syntax trees.

Part 1: Introduction to trees and their properties

Part 2: Rooted trees, binary trees

Some applications of trees

See also: Essential Algorithms, chapter 10, Trees, especially sections on tree terminology and binary trees.

Resources

Additional reading

Comprehension check

  1. A node of degree one is called a ________________________.
  2. True or false? We can always calculate which node is the root for any tree.
  3. In any tree there can be only __________________ path between any pair of nodes.
  4. The height of a tree is given by the number of edges in a path from the ________________________ node to the most distant __________________.
  5. Every tree of N nodes will have _____________________ edges.
  6. All rooted trees have a hierarchical structure.

Answers: ǝslɐɟ / Ɩ - u / ɟɐǝl ’ʇooɹ / ǝuo / ǝslɐɟ / ɟɐǝl

Original author: Clayton Cafiero < [given name] DOT [surname] AT uvm DOT edu >

No generative AI was used in producing this material. This was written the old-fashioned way.

All materials copyright © 2020–2023, The University of Vermont. All rights reserved.