5.2 Leftist Heaps Merge Operation | Leftist Heaps| Code, Steps & Example

[@sweet_manu01]

Tommorw i have exam!! And i found this video after struggling so much..... Superb explanation sir, Thank you so much 🙏

[@uzairjavedakhtar3718]

All the best for your exam👍😊

[@鸭梨-n6m]

The process of your course is detailed and easy to understand. Thank you for your course! :)

[@uzairjavedakhtar3718]

Happy to know that you liked it😊

[@RakeshKumar-rl4xt]

Awesomely explained. Thank you for your efforts.👏

[@ikersantana7618]

Thank you for this helpful video.

[@uzairjavedakhtar3718]

Most Welcome☺️

[@BigMan111]

How do we update the S(x) for each node after merging tho?

[@ranjitha.c3651]

Nice explanation sir, thanks a lot

[@uzairjavedakhtar3718]

Most welcome😊

[@Xiuqi_liu]

Your video is awesome. Such a nice course, thank u!!!!

[@uzairjavedakhtar3718]

Thank You for appreciating my efforts.
This really motivates me☺️
Please share the course with your friends 🖤

[@beluga3570]

Well explained 👍🏻

[@uzairjavedakhtar3718]

Thank you 🙂

[@larbistudentsaidchikh4877]

thank you so much

[@uzairjavedakhtar3718]

You are welcome🖤☺️

[@mohamedstudentbenabdelouah4352]

Thanks !

[@uzairjavedakhtar3718]

Welcome!🖤

[@subhashinipargunam162]

Please make it shorted , and avoid using the leftist tree term again and again over every sentence , which makes us feel like the problem is a complicated one to understand