Question 1(Programming): Write a C++ program to build a binary search tree based on the following number sequence. Then print out this tree in preorder, inorder, and post order. You must implement the three traversal functions recursively. Failed to build a binary search tree structure will cause a 0 in this section.

[6, 10, 7, 14, 3, 11, 5, 15, 4, 13, 12, 2, 8, 9, 1]