What is a Tree? Define Node, Root, Leaf, Edge, Height, Depth.

Difficulty: 3/10

Tree structure, Node relationships, Depth/Height

Tree Fundamentals

A tree is a hierarchical, non-linear data structure composed of nodes connected by edges. A tree has no cycles, and for n nodes it contains exactly n-1 edges. The root is the topmost node. A node with no children is a leaf. An edge connects two nodes. Depth is the number of edges from the root to a node. Height of a node is the number of edges on the longest downward path to a leaf; the height of the tree is the height of its root.

javascript

1
Node: Individual element in a tree.
2
Root: Topmost node with no parent.
3
Leaf: Node with no children.
4
Edge: Connection between two nodes.
5
Depth: Distance in edges from root to a node.
6
Height: Longest downward path measured in edges.

Scenario Questions

0-2 years experience

Follow-up Questions