Write a C++ code to construct a binary tree of depth 5. You can use random data to fill the data part of your tree node. Write inorder, pre-order, and post-order traversal strategies and show the results of each traversal technique.