***IN C++***
Short simple functions:
1. Write a function that adds a node and two child nodes to atree and of course links them and assignsvalues.
2. Write a function that does a Preorder traversal of a 3 nodetree
3. Write a function that does a Postorder traversal of a 3 nodetree
4. Write a function that does a Inorder traversal of a 3 nodetree.
5. Write functions for cyclic shift that accepts shift n, andstring, with length as arguments. Assume 32 bits
6. Write a function for modulus hash (accepts N, and an array ofvalues as arguments.
7. Write a function that implements LINEAR PROBING using amodulus
OR
OR