A Tree is a recursive explanation. A tree is a data structure composed of nodes. Each tree has a root node. (Actually, this isn't strictly necessary in graph theory, but it's usually how we use trees in programming, and especially programming interviews) The root node has zero or more child nodes Each child node has zero or more child nodes, and so on. The tree cannot contain cycles. The nodes m..
