Describe, in java pseudo$-$code an algorithm for finding a node with a data value $\text{'}$u$\text{'}$ in a tree T by means of a pre$-$order traversal method. Assume binary tree is represented and implemented in double linked list.

search $($node x$)$

$\{$

Node f $=$ new Node$()$;

f$.$x $=$ x;

Your Code...........

return x;

$\}$