Question

Write a program to transform a free tree to a rooted tree. The free tree and the root are input by the user, and for the rooted tree, you output it level by level. (Hint: Use Adjacency Matrix or Adjacency Lists to store the tree, and use a queue to implement the transformation.)

Answer 1

code:

NodeTree.java

class NodeTree

{

int DataVal;

NodeTree leftNode, rightNode;

public NodeTree(int itemValue)

{

DataVal = itemValue;

leftNode = rightNode = null;

}

}

TransTree.java:

class TransTree

{

NodeTree rootNode;

public TransTree()

{

rootNode = null;

}

void printLevelOrderTree()

{

int hVal = DefineHeight(rootNode);

int iter;

for (iter=1; iter<=hVal; iter++)

printGivenLevelTree(rootNode, iter);

}

int DefineHeight(NodeTree rootNode)

{

if (rootNode == null)

return 0;

{

int LeftHeight = DefineHeight(rootNode.leftNode);

int RightHeight = DefineHeight(rootNode.rightNode);

if (LeftHeight > RightHeight)

return(LeftHeight+1);

return(RightHeight+1);

}

}

void printGivenLevelTree (NodeTree rootNode ,int Levels)

{

if (rootNode == null)

return;

if (Levels == 1)

System.out.print(rootNode.DataVal + " ");

else if (Levels > 1)

{

printGivenLevelTree(rootNode.leftNode, Levels-1);

printGivenLevelTree(rootNode.rightNode, Levels-1);

}

}

public static void main(String args[])

{

TransTree CreateFreetree = new TransTree();

CreateFreetree.rootNode= new NodeTree(1);

CreateFreetree.rootNode.leftNode= new NodeTree(2);

CreateFreetree.rootNode.rightNode= new NodeTree(3);

CreateFreetree.rootNode.leftNode.leftNode= new NodeTree(4);

CreateFreetree.rootNode.leftNode.rightNode= new NodeTree(5);

System.out.println("Level order traversal of binary tree is ");

]

CreateFreetree.printLevelOrderTree();

}

}

Sample Output: E: IJavaljdk1.6.0_17\bin>javac NodeTree.java E:\Java\jdk1. 6.0 17\bin>j avac TransTree. java E:\Java\jdk1.6.0_17Abinsjava TransTree Level order traversal of binary tree is 1 2 3 4 5 ENJavaljdk1. 6.0 17\bin>

If any queries please get back to me

Thank You