A tree is a connected undirected graph with no cycles.
What Is Tree?
A tree is a connected undirected graph with no cycles.
Examples of Tree
1
A file-system hierarchy can be modeled as a tree.Formula and Key Points
Formula / rule
For n vertices, a tree has n−1 edges.
- Know the definition and standard notation for Tree.
- Be able to recognise or compute tree in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms.
Related Math Terms
Tree: Frequently Asked Questions
What is Tree?
A tree is a connected undirected graph with no cycles.
Why is Tree useful in computer science?
Used in networks, routing, dependency graphs, compilers, social networks, file systems and graph algorithms.