Trees
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.鈥攃ool 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
- A node of degree one is called a ________________________.
- True or false? We can always calculate which node is the root for any tree.
- In any tree there can be only __________________ path between any pair of nodes.
- The height of a tree is given by the number of edges in a path from the ________________________ node to the most distant __________________.
- Every tree of N nodes will have _____________________ edges.
- All rooted trees have a hierarchical structure.
Answers: 菨sl蓯蔁 / 茤 - u / 蔁蓯菨l 鈥櫴噊o晒 / 菨uo / 菨sl蓯蔁 / 蔁蓯菨l
Copyright 漏 2023鈥�2025 Clayton Cafiero
No generative AI was used in producing this material. This was written the old-fashioned way.