1.Prove that at most one tri-node restructure operation is needed to restore balance after any insertion in an AVL tree.
2.Prove that every connected graph has a vertex whose removal will not disconnect the graph. Describe an algorithm that finds such a vertex.