How can I print an inorder/preorder/postorder traversal of a binary search tree made in C that puts brackets around each subtree like this:

(in-order): [[[0] 2 [[[4] 5] 7 [9]]] 10 [11]]

(pre-order): [10 [2 [0] [7 [5 [4]] [9]]] [11]]

(post-order): [[[0] [[[4] 5] [9] 7] 2] [11] 10]