using the provided pseudo code create a RBtree search program using java

RB-INSERT (T, z) LEFT-ROTATE (T, x) y- T.nil x = 1 . root while x T.nil y -x.right x.right- y.left if y.left T.nil // set y // turn y's left subtree into x's right subtree if z.key