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

Describe a nonrecursive method for performing an Euler tour traversal of a
binary tree that runs in linear time and does not use a stack.
C-7.29
Describe, in pseudo-code, a nonrecursive method for performing an in-order
traversal of a binary tree in linear time.
C-7.30
Let T be a binary tree with n nodes (T may be realized with an array list or a
linked structure). Give a linear-time algorithm that uses the methods of the
Binary Tree interface to traverse the nodes of T by increasing values of the level
numbering function p given in Section 7.3.5. This traversal is known as the level
order traversal.
C-7.31
The path length of a tree T is the sum of the depths of all the nodes in T.
Describe a linear-time method for computing the path length of a tree T (which
is not necessarily binary).
C-7.32
Define the internal path length, I(T), of a tree T to be the sum of the depths of
all the internal nodes in T. Likewise, define the external path length, E(T), of a
tree T to be the sum of the depths of all the external nodes in T. Show that if T is
a proper binary tree with n nodes, then E(T) = I(T) + n − 1.
Projects
P-7.1
Implement the binary tree ADT using an array list.
P-7.2
Implement the tree ADT using a linked structure.
P-7.3
Write a program that draws a binary tree.
P-7.4
Write a program that draws a general tree.
P-7.5
443