Given a binary tree of maximum n nodes with integer data type. Convert a binary tree to corresponding undirected graph which will have maximum n number of nodes. While converting tree to graph, traverse the tree in In-order fashion. Traverse the formed graph and print the data.