Traversals , Height , mirror image and copy of Binary Tree

[snehalkhandve]

Many operations can be performed on a given binary tree which are useful in competitive programming problems . I am interested to implement pre-order , post-order and in-order traversal , finding height , mirror image and copy of a binary tree .

[snehalkhandve]

Should I start working on it ?

[rishabhgarg25699]

@snehalkhandve assigned