Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

P-7.10
Write a program that visualizes an Euler tour traversal of a proper binary tree,
including the movements from node to node and the actions associated with
visits on the left, from below, and on the right. Illustrate your program by
having it compute and display preorder labels, inorder labels, postorder labels,
ancestor counts, and descendent counts for each node in the tree (not necessarily
all at the same time).
P-7.11
The arithmetic expression code shown in Code Fragments 7.29–7.32 only work
for Integer expressions with the addition operator. Write a Java program that
can evaluation arbitrary expressions of any Number type of object.
Chapter Notes
Discussions of the classic preorder, inorder, and postorder tree traversal methods can
be found in Knuth's Fundamental Algorithms book [62]. The Euler tour traversal
technique comes from the parallel algorithms community, as it is introduced by
Tarjan and Vishkin [89] and is discussed by J´aJ´a [53] and by Karp and
Ramachandran [57]. The algorithm for drawing a tree is generally considered to be a
part of the "folklore" of graph drawing algorithms. The reader interested in graph
drawing is referred to works by Tamassia [88] and Di Battista et al. [30]. The puzzler
in Exercise R-7.10 was communicated by Micha Sharir.
446