TAOCP 2.3.4.6: History and Bibliography

Section 2.3.4.6 exercises: 4/4 solved.

4 items

Section 2.3.4.6. History and Bibliography

Exercises from TAOCP Volume 1 Section 2.3.4.6: 4/4 solved.

#	Rating	Status	Time
1	[**]	verified	2m39s
2	[**]	solved	2m53s
3	[**]	solved	4m01s
4	[**]	verified	1m21s

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.3.4.6: History and Bibliography ›

Let the sides of the convex $(n+2)$-gon be distinct and let one of them be designated as the root side $r$.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.3.4.6: History and Bibliography ›

**Corrected Solution to Exercise 2.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.3.4.6: History and Bibliography ›

Label the vertices of the convex $n$-gon by $1,2,\dots,n$ in cyclic order.

Practice › Mathematics › TAOCP › TAOCP Vol 1: Fundamental Algorithms › TAOCP 2.3.4.6: History and Bibliography ›

By Exercise 1 there is a one-to-one correspondence between binary trees with $n$ nodes and triangulations of a convex $(n+2)$-gon.