Given the following implementation of tree. implement the following functions.Your task is to implement three different tree traversal algorithms $-$ preorder, inorder, and postorder traversal. Your implementation should include the following methods:preorderTraversal$($TreeNode root$)$: This method should return a List