An Introduction to Trees and Basic Tree Properties
In this chapter, you are going to study the basics of the `tree data` structure!
We'll cover the following
Introduction
Trees consist of vertices (nodes) and edges that connect them. Unlike the linear data structures that you have studied so far, trees are hierarchical. They are similar to graphs, except that a cycle cannot exist in a tree. They are acyclic. In other words, there is always going to be exactly one path between any two nodes.
- Root Node: A node with no parent nodes.
- Child Node: A node that is linked to an upper node (parent node).
- Parent Nodes: A node that has links to one or more child nodes.
- Sibling Node: Nodes that share the same parent node.
- Leaf Node: A node that doesn’t have any child nodes.
- Ancestor Nodes: The nodes on the path from a node d to the root node. Ancestor nodes include node d’s parents, grandparents, and so on.
The figure below shows all the terminologies described above:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.