Lesson 4 - Advance Data Structures

tree

a nonlinear hierarchical data structure that consists of nodes connected by edges.

Root

Trees consists of nodes, where the topmost node is called the what?

child node

In a tree, every other node can have one or more what?

Root node

The topmost node in a tree, which does not have a parent. There is only one root node

Parent node

A node which has a branch from it to any other node. the node which has one or more children

Child Node

A node that is an immediate descendant of another node. All the nodes except root node are child nodes

Siblings

: Nodes which belong to the same parent

Edge

: The connecting link between any two nodes.

Internal Node

: A node with at least one child.

Leaf Node (External Node)

: Nodes that do not have any child

Level of a Node

: The number of edges in the path from the root to that node. The root node is at level 0 and increments by 1 at each level or step.

Depth

: Total number of edges from root node to a particular node

Subtree

: A node and all its descendants form a subtree.