Various tree data structure terms

• Root Top-most node of the tree.
• Leaf Node with no children.
• Internal node Node with at least one child.
• Parent / Child Nodes directly connected: parent → child.
• Siblings Nodes with the same parent.
• Edge Connection between parent and child.
• Path Sequence of edges connecting nodes.
• Depth Number of edges from root to node.
• Height Max depth from a node to its deepest leaf.
• Subtree Tree formed by any node and its descendants.
• Degree Number of children a node has.
• Binary Tree Tree where each node has ≤ 2 children.
• Binary Search Tree (BST) Binary tree with left ≤ node ≤ right property.
• Complete / Full / Perfect Tree Special types of trees based on shape and node count.