Prefix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode

แชร์
ฝัง
  • เผยแพร่เมื่อ 26 ส.ค. 2024
  • Support Simple Snippets by Donations -
    Google Pay UPI ID - tanmaysakpal11@okicici
    PayPal - paypal.me/tanmaysakpal11
    --------------------------------------------------------------------------------------------- Learn how to convert prefix to infix expression using stack data structure using a set of rules. In this tutorial we will study and understand the rules, pseudocode as well as the working of stack data structure in this prefix to infix conversion. One of the application of stack data structure is to convert prefix to infix expression because of its properties and mode of operation that is Last In First Out (LIFO) or First In Last Out (FILO)
    Prefix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
    We will also dry run the pseudocode on an example and cross check the result with the manual conversion result.
    Theory & Code article - simplesnippets...
    Full DSA playlist - • Introduction to Data S...
    C++ Programming Tutorials for Beginners Course - • Introduction to Comput...
    Simple Snippets Official Website -
    simplesnippets....
    Simple Snippets on Facebook -
    / simplesnippets
    Simple Snippets on Instagram -
    / simplesnippets
    Simple Snippets on Twitter -
    / simplesnippet
    Simple Snippets Google Plus Page -
    plus.google.co...
    Simple Snippets email ID -
    simplesnippetsinfo@gmail.com
    For More Technology News, Latest Updates and Blog articles visit our Official Website - simplesnippets....
    #stack #postfixtoinfix #infixprefixpostfix #datastructures #algorithms

ความคิดเห็น • 16

  • @onurcanisler
    @onurcanisler 3 ปีที่แล้ว +4

    You saved my day as usual.

    • @SimpleSnippets
      @SimpleSnippets  3 ปีที่แล้ว +1

      Thanks buddy! Please do share the videos and our channel with your friends if you want to genuinely support me & our channel!✌😇

  • @analayamini8435
    @analayamini8435 3 ปีที่แล้ว

    Bhaiya your explanation was next level ,it was awesome.

  • @srisheeran6273
    @srisheeran6273 4 ปีที่แล้ว +2

    Don't stop.Do more videos.

    • @SimpleSnippets
      @SimpleSnippets  4 ปีที่แล้ว +1

      Yes I wont be stopping anytime soon buddy 😇

    • @srisheeran6273
      @srisheeran6273 4 ปีที่แล้ว +1

      @@SimpleSnippets I said it cause the views are low.

    • @kavitakaushik8090
      @kavitakaushik8090 4 ปีที่แล้ว

      Please don't stop making videos

  • @asldfkhjaslk
    @asldfkhjaslk 3 ปีที่แล้ว +1

    Typo in the name, great video as always

  • @asadurrehman9278
    @asadurrehman9278 2 ปีที่แล้ว

    Hello, my question is why we reverse the infix string? what is the reason to reverse the string?

  • @susmitsingh1775
    @susmitsingh1775 3 ปีที่แล้ว

    Brilliant

  • @hritvikagarwal7347
    @hritvikagarwal7347 4 ปีที่แล้ว +1

    s.push("(" + op1 + prefix[i] + op2 + ")");
    how this line is justified.Why+ is used in between to Display the final expression

    • @SimpleSnippets
      @SimpleSnippets  4 ปีที่แล้ว +2

      + is for concatenation. Dry run the line and you will justify it yourself 😇

  • @agastyasen
    @agastyasen 3 ปีที่แล้ว

    can someone share the C code for this?

  • @shivamchaudhary9898
    @shivamchaudhary9898 3 ปีที่แล้ว +1

    Bro u have to check title name(spelling of prefix..) not pretfix plz..