Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1) Check if the current node is empty or null.
- 2) Traverse the left subtree by recursively calling the in-order function.
- 3) Display the data part of the root (or current node).
- 4) Traverse the right subtree by recursively calling the in-order function.
Add Comment
Please, Sign In to add comment