the Red-Black BST that results when you insert the keys

(BI). Implement a Red-Black tree with only operation Insert(). Your program should read from a file that contain positive integers and should insert those numbers into the RB tree in that order. Note that the input file will only contain distinct integers. Print your tree by level using positive values for Black color and negative values for Red color. Do not print out null nodes. Format for a node: (, ). For example, the following tree is represented as (12, null) (5, 12) (15, 12) (3, 5) (-10, 5) (13, 15) (17, 15) (-4, 3) (7,-10) (11, -10) (-14, 13) (-6, 7) (-8, 7) 3 4 6 12 10 8 11 13 15 14 17

in java replit code please

What will be the Inorder traversal of the following tree?*           11, 20, 29, 32, 41, 50, 65, 72, 91, 99       11, 20, 29, 32, 50, 65, 72, 91, 99, 41       11, 32, 50, 72, 99, 29, 65, 91, 20, 41       41, 20, 11, 29, 32, 65, 50, 91, 72, 99       41, 20, 11, 65, 91, 99, 29, 32, 50, 72