1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
| package es_algo2;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.Arrays;
class Node
{
int data;
Node left;
Node right;
}
class BST
{
public Node createNode(int p)
{
Node a=new Node();
a.data=p;
System.out.println("k="+p);
a.left=null;
a.right=null;
return a;
}
public Node insert (Node node, double[][] matrix, int j)
{
if(node==null)
{
System.out.println(j);
return createNode(j);
}
if(matrix[0][j]==0)
{
node.left=insert(node.left,matrix, j);
}
else if (matrix[0][j]>0)
{
node.right=insert(node.right,matrix, j);
}
return node;
}
}
public class ES_algo2 {
public static void main(String[] args) throws IOException {
double[][] matrix = Files.lines(Paths.get("matrice_sim2.csv"))
.map(line -> Arrays.stream(line.split(";"))
.mapToDouble(Double::parseDouble)
.toArray())
.toArray(double[][]::new);
System.out.println(matrix[0][2]);
BST a=new BST();
Node root=null;
root=a.insert(root,matrix,0);
}
} |
Partager