Trees are a fundamental data structure in computer science that consists of nodes connected by edges. The topmost node, without any ancestors, is called the root node. A rooted tree is a tree with a specific node designated as the root. Each node can have a parent node, except for the root. The height of a tree is the largest level of the tree plus one. Leaf nodes are nodes that do not have any children.