Given the following Binary Search Tree, what is the output of the following code, assuming we call preOrder$($root$)?$

$\backslash$table$[[$Java$,$C#$],[,\backslash$table$[[$class Noche $\{],[$public int data;$],[$public Node left;$],[$public Node right;$]]],[\backslash$table$[[$public static void preOrder$($Node root$)\{],[$if$($root$!=$null$)]],\backslash$table$[[$public static void preOrder$($Node root$)\{],[$if$($root$!=$null$)\{]]]]$