Tree Traversal in Data Structure | Infix to Postfix | inorder and preorder is given find postorder

[@sampoornam8496]

Mam your teaching is Excellent and Marvelous keep rocking Mam Thank you for your efforts

[@lakshmikanthreddykamjula7691]

I salute you madam for your teaching

[@lakshmikanthreddykamjula7691]

Fascinating Teaching madam

[@rubeenashibinp4271]

Finely cleared mam. Thank you so much

[@priyams4566]

Thank mam, atlast many doubts clear because of you mam

[@nagajothi3775]

Nice presentation!!

[@vettri5002]

Very clear explanation

[@amritshree8056]

thank you mam ...wonderful explaination

[@yugandharakamkhedkar1469]

It's very helpful.. thank you..

[@gangayadhavan]

Very nice explanation mam

[@pratheebak1297]

super explanation mam.thank you mam

[@sunitam1025]

Very clear explanation mam.thank you

[@hemalathaa4333]

Concept cleared....Thank you mam

[@sugunam7412]

Thank You Mam

[@dhivyaj152]

Very nice mam

[@nithiyavathi9129]

Vèry çleàr màm,thànkß

[@sangitaprasanna2395]

Super explanation mam 👍

[@sanjustudy341]

Master theorem ad recurrence relations short video mam

[@sorajsahu5136]

Mam sach me mera doubt clear hogaya...mam but if it is postfix to prefix. How can I do mam

[@RajuRaju-pk6pb]

Hamming code with one session mam

[@udarisrivardhan4399]

Hi mam

[@sheikhashrafcom]

Upload it again..as vedio is not clear ..

[@unifystudy.Priyanka.Chatterjee]

Video quality is clear. Check your internet connection