TreeTraversal added

[ram123-debug]

BSTree traversal like inOrder, preOrder and postOrder functions are added with O(n) time and O(n) space complexity

 know more

Describe your change:

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new JavaScript files are placed inside an existing directory.
• All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames.
  Example:UserProfile.js is allowed but userprofile.js,Userprofile.js,user-Profile.js,userProfile.js are not
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[ram123-debug]

Not able meet your requirement , need help

[raklaptudirm]

Please elaborate what you need help on.

[ram123-debug]

Not able to pass the the Continuous Integration / Code style and tests (pull_request) . Please fix it

[raklaptudirm]

You must install the standard.js package and run the standard --fix . command on the files.

[ram123-debug]

standard fix is done

[raklaptudirm]

Some formatting stuff.

[CarlosZoft]

LGTM 🔥

[appgurueu]

Please make it apparent that these are binary tree traversals rather than general tree traversals.

I also don't like pushing the results to an array, I'd rather use a visitor or generator pattern here as to not incur the O(n) space complexity.

Furthermore, please consider integrating this (making it a bunch of methods) with our existing binary (search) tree implementation.

Also please add tests & some more comments.

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.