Pre, Post and In order traversal of binary trees

[MuskanSapolia]

DESCRIPTION

Pre-order :-
visit the root node
traverse the left sub-tree
traverse the right sub-tree
In-order :-
traverse the left sub-tree
visit the root node
traverse the left sub-tree
Post-order :-
traverse the left sub-tree
traverse the right sub-tree
visit the root node

EXPECTED OUTCOME

all nodes of tree should be traversed.

[Jatin86400]

I would like to work on the pre order, post order and in order traversals in a binary tree

[Jatin86400]

I would code in c++

[prateekiiest]

I guess @Jatin86400 , you need to open a new issue for it, otherwise GitHub is not showing your name on the assign list

[Jatin86400]

ok

[prateekiiest]

pls post this issue link in your corresponding PRs

[promaroy]

Can I work on this issue?