Skip to content

Inorder program #963

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
ironmanMA wants to merge 1 commit into from
Closed

Inorder program #963

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions exercises/in-order/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
# In order

![Binary Tree In-Order](https://upload.wikimedia.org/wikipedia/commons/7/77/Sorted_binary_tree_inorder.svg "Binary Tree")

Output In-order: A, B, C, D, E, F, G, H, I.

Algorithm:
* Check if the current node is empty / null.
* Traverse the left subtree by recursively calling the in-order function.
* Display the data part of the root (or current node).
* Traverse the right subtree by recursively calling the in-order function.

In a search tree, in-order traversal retrieves data in sorted order