Question

Project by c++ Given an adjacencymatrix1-Check if the adjacency matrix represents am-ary unrooted treem>=2. Otherwise terminate.2-Allow the user to choose anode as the root.3-Convert the m-ary tree in the adjacency matrix to a binary tree ina binary tree data structure taking the node chosen by the user as the root.4-If the tree is not balanced, traverse the tree inorder and insert the traversed nodes in a Balanced Binarysearchtree(AVL tree).5-Traverse the final AVL tree in preorder, inorder and postorder fashions

Answer 1

Explanation:

sorry i dint understand

Answer 2

Explanation:

Please write something that makes sense

We are unable to understand your question