with this pseudocode given what would be printed for the following tree

algorithm traverse (val root <pointer to root node>)

and the tree would beCode:`1. if (root is not NULL)`

1. print (root)

2. traverse (root->left)

3. traverse (root->right)

4. traverse (root)

2. return

thanks mates :)Code:`(M)`

/ \

(F) (T)

\ /

(J) (P)

i actually need this answer in the next 4 hours so i am really hoping that someone sees it before then :D