[Idea]: <Expression Tree> #1385
Labels
enhancement
New feature or request
gssoc-ext
Contributions made as part of GirlScript Summer of Code Extended Edition.
hacktoberfest-accepted
PRs accepted for Hacktoberfest 2024. Ensures contributions are counted towards the official Hackt...
level1
GirlScript Summer of Code | Contributor's Levels
Idea Title
Expression Tree
Idea Description
Expression Tree
Name
Given a postfix expression construct a tree that stores operator as internal nodes and the opernads as leaves. On inorder traversal it gives the infix expression of the postfix.
About:
Implementation of Binary tree.
Input:
The postfix expression.
Output:
The infix expression
Potential Benefits
Implementation Suggestions (Optional)
No response
The text was updated successfully, but these errors were encountered: