Example: Examples of Computational Problems
(related to Part: Computability)
The formal definition of problems can be better explained by some of the following examples:
Example 1
 Domain: Trees.
 Instance: A given tree $T$
 Question: What is the length of the longest path contained in $T$?
 Types of answers: natural numbers $\mathbb N$.
Example of a decision problem
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Lawler; Lenstra; Rinnooy Kan; Shmoys: "The Traveling Salesman Problem", WileyInterscience, 1985