Question

Write a public method “printRootToLeafPath()” that prints out ALL its root-to-leaf paths. Note: you should use internal recursive private method to print all paths

java code

Answer 1

Node.Java

class Node

{

int num;

Node leftNode,rightNode;

Node(int element)

{

num=element;

leftNode=rightNode=null;

}

}

Main.java

class Main

{

Node rootNode;

public static void printRootToLeafPath(Node node)

{

int p[]=new int[100];

printRootToLeafPathRecursive(node,p,0);

}

public static void printRootToLeafPathRecursive(Node n, int p[], int len){

if(n== null)

return;

p[len]=n.num;

len++;

if(n.leftNode==null && n.rightNode==null)

displayArr(p,len);

else

{

printRootToLeafPathRecursive(n.leftNode,p,len);

printRootToLeafPathRecursive(n.rightNode,p,len);

}

}

public static void displayArr(int nums[],int len)

{

for (int i=0;i<len;i++)

{

System.out.print(nums[i]+" ");

}

System.out.println("");

}

public static void main(String args[])

{

Main BTree=new Main();

BTree.rootNode=new Node(15);

BTree.rootNode.leftNode=new Node(9);

BTree.rootNode.rightNode=new Node(1);

BTree.rootNode.leftNode.leftNode=new Node(4);

BTree.rootNode.leftNode.rightNode=new Node(6);

BTree.rootNode.rightNode.leftNode=new Node(3);

BTree.printRootToLeafPath(BTree.rootNode);

}

}

if you like the answer please provide a thumbs up.