Tree Functions

Linked List Operations (see how many you can add!)

Print all the left-most nodes. (Going down to the left side.)

Print all the right-most nodes

(going down to the right side)

Add 1 to the data field of all nodes in the tree

Print the data for all (and only) the leaves of the tree

Print the data for all (and only) the NON-leaves of the tree

Print the tree to LOOK like a tree

Print the tree to look like a tree and include arrows to children (/ or \ )

Count the number of leaves

Sum all the data fields of the tree

Determine which side of the tree has more nodes

Count the number of different paths the tree has. (Top to bottom.)

Print the path of the longest path that can be taken from top to bottom.