There can be implementation of preorder, inorder and postorder in one code only of Binary Tree

[Akanksha10029]

There can be implementation of preorder, inorder and postorder in one code only of Binary Tree instead of making different files we can show these three in one code only. We can provide the structure of tree and can get its preorder, inorder and postorder as an output.