Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upPre, Post and In order traversal of binary trees #171
Assignees
Comments
|
I would like to work on the pre order, post order and in order traversals in a binary tree |
|
I would code in c++ |
|
I guess @Jatin86400 , you need to open a new issue for it, otherwise GitHub is not showing your name on the assign list |
|
ok |
|
pls post this issue link in your corresponding PRs |
|
Can I work on this issue? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.