In the talk I explain the definition of a tree decomposition of a graph, and using simple examples I illustrate some of the intuition behind this important combinatorial concept, which is useful in computer science for designing efficient algorithms as well as in structural graph theory as a tool for proving theoretical results.