search

NJACKWinterOfCode / nwoc_algorithms

This is a library of various algorithms that are used in competitive programming.
6 stars 52 forks source link

Tree Sort, Infix2PostfixPrefixValue #122

Closed adiXcodr closed 4 years ago

adiXcodr commented 4 years ago

Tree Sort- Sorting given values by adding them in a Binary Search Tree and then storing the Inorder Traversal to get sorted values. (C++)

Infix Evaluation- Converts given Infix expression to Prefix, Postfix and calculates the value of the same. (C++)

Bhavnaharitsa commented 4 years ago

Could you make separate algorithms for infix, prefix and postfix

adiXcodr commented 4 years ago

Could you make separate algorithms for infix, prefix and postfix

Sure. I'll do it and create a new PR. Do we need an infix to postfix/prefix converter or an expression evaluator for all the three forms?

Bhavnaharitsa commented 4 years ago

Sure, you can close this now.

adiXcodr commented 4 years ago

Sure, you can close this now.

As I asked before, Do we need an infix to postfix/prefix converter or an expression evaluator for all the three forms? Thanks.

Bhavnaharitsa commented 4 years ago

convertor for now

adiXcodr commented 4 years ago

convertor for now

Sure.