It would be nice to have a method is Root() for the Binary Node class which returns true if the node is the root of its tree. Explain why it is not possible to write such a method using the current...

It would be nice to have a method is Root() for the Binary Node class which returns true if the node is the root of its tree. Explain why it is not possible to write such a method using the current representation. How might the Binary Node class be modified to allow such a method to be written?

Is the order in which nodes are visited in a postorder traversal the reverse of the order produced by a preorder traversal? Explain.