
Exercises and problems in Informatics January 2004 
I. 67. There are N teams playing a round tournament (2\(\displaystyle \le\)N \(\displaystyle \le\)100, with N even). Write your program (i67.pas, ...) that displays a draw for rounds fulfilling the requirements that every team should play in any round, and should meet with any other team exactly once.
See the example for N=4:
Team  1  2  3  4  Round 1  2  1  4  3  Round 2  3  4  1  2  Round 3  4  3  2  1 

(10 points)
I. 68. Any binary tree can be represented as a parenthetical expression. For example, (X) corresponds to a tree with one node, while ((X)X(X)) denotes a tree consisting of the root and its left and right child. See further examples.
((X)X)   (X(X))   (((X(X))X)X((X)X((X)X(X))))  
Write your program (i68.pas, ...) whose input is a parenthetical expression representing a binary tree (containing at least one node), then displays the tree (see the figures). 