Please provide complete Java class code with main() function.

Construct a binary tree.

(1) Output the height of the tree.

(2) Randomly pick tree nodes and output their depths.

(3) Implement pre-order, in-order, and post-order tree traversal algorithms to traverse this binary tree. Print out these three traversal orders and compare them with your manual computations/calculations by hands.