This is a data structure question, please help me quickly.
Which of the following statements is true?
1. The length of a path is the number of vertices on that path.
2. The possible maximum number of edges in a graph with n nodes is n^3.
3. An AVL tree is always the same after deletion and then insertion of the same node.
4. A subtree of an AVL tree is always an AVL tree.