C++

Note that the Node with the label R is the root node for the following Binary Tree. R M T A B (2 points) For the above Binary Tree, give the PreOrder traversal: (2 points) For the above Binary Tree, give the InOrder traversal: (2 points) For the above Binary Tree, give the PostOrder traversal: (1 point ) For the above Binary Tree, what is the Height of the Tree: Preface your answers as follows: PreOrder: InOrder: PostOrder: Height