Code to print paths from root to all leaves in the BT recursively.


private void printRootToLeafNodes( Node node, int[] arr, int length ){

if( node == null){
return;
}

arr[length++] = node.getValue();

if( node.getLeftNode() == null && node.getRightNode() == null){
for( int i = 0; i < length ; i++){
System.out.print( arr[i] + "  ");
}
System.out.println();
return;
} else {
printRootToLeafNodes(node.getLeftNode(),  arr, length );
printRootToLeafNodes(node.getRightNode(), arr, length );
}

}