Phyley CS

Пікірлер

@endfine9230 7 ай бұрын

best explanation

@skljbd 8 ай бұрын

This is the best solution which saves the effort of recording whether its the second time to visit the node, amazing!

@danielshahverdi7053 11 ай бұрын

Thank you for making this video🙏🙏

@gabrielalmeida8584 Жыл бұрын

The best video on youtube about it. Thank you

@farhangouri93 Жыл бұрын

great explanation!! thank you!!

@AparnaBushan Жыл бұрын

I think this is the best explanation out there for postorder iterative!

@quannguyenhahong168 Жыл бұрын

Thank you, great explanation!

@dalaibrahim Жыл бұрын

thank you this was super helpful

@dsclips900 Жыл бұрын

Hi man, why you stopped uploading videos, they are very instructive, thanks!

@PhyleyCS Жыл бұрын

Hello! I got busy with other things and other channels... 🙂 Thanks for asking!

@dsclips900 Жыл бұрын

@@PhyleyCS Which channels?

@PhyleyCS Жыл бұрын

Mostly related to web development. Recently, I started this channel: www.youtube.com/@StrangestCode

@reshsajitalks9843 Жыл бұрын

Best explanation

@rishimegharaj2913 2 жыл бұрын

Nice explanation...

@yahircorona-martinez9311 2 жыл бұрын

Great video and thanks for walking through the code!

@ElementMucho 2 жыл бұрын

Thank you so much

@QUITEthegamer 2 жыл бұрын

really good explanation

@harsh9558 2 жыл бұрын

Best video 🔥

@emmanuelezeka7236 2 жыл бұрын

Yo, your video is amazing. Like I couldn't move on without visualizing what you shared in this video. Thanks and I am looking forward to equivalent content in other parts of DSA.

@krishnaneeldey8722 2 жыл бұрын

Your videoes are super cool 💥

@chestermartin2356 2 жыл бұрын

Most helpful video yet, still not clicked with me yet but I feel about 10 steps further now

@chestermartin2356 2 жыл бұрын

Although I went back to rewrite my method and immediately understood it so great success :D thank you

@jatinchoubey6053 2 жыл бұрын

Best Video. I understood the concept completely. Thanks alot ❤️❤️⚡⚡

@anschoudhary1376 2 жыл бұрын

splendid

@luiza4142 2 жыл бұрын

Best explanation i ever see, thanks.

@larryellison531 2 жыл бұрын

explanation is good.

@Shiv-vb1re 3 жыл бұрын

Thanks man

@Magmatic91 3 жыл бұрын

Thank you so much, I think after seeing many videos about this subject I finally understood the concept of recursion thanks to your explanation.

@MotherJammer 3 жыл бұрын

Thank you for your great explanation! Helped me a lot for my algorithm class :D

@PerfectCodeAcademy 3 жыл бұрын

it is wonderful thank you..

@rachelf5466 3 жыл бұрын

Thank you for making this visual representation! I've been looking for one of these for a while to understand the traversals

@ikhlasadely4556 3 жыл бұрын

thank you

@haythemoldaccount7953 3 жыл бұрын

Hello, thank you for the video, I was wondering if it were possible to make the function int instead of Node* and just return root->key instead of root ? thank you

@PhyleyCS 3 жыл бұрын

Hi, glad you liked it! The point of the function is to return the pointer to the node with a given key (or nullptr if there's no such node), so you actually already know what the key is. The problem with returning the key is that it does not seem useful and it is not clear what should be returned if the key is not in the tree. If what you want is to just know whether the key is present in the tree, you can return a bool instead of Node *.

@haythemoldaccount7953 3 жыл бұрын

@@PhyleyCS oohhhh okay silly me lol, I can't believe that slipped my mind, that makes a lot more sense haha. thanks

@nahleaky586 3 жыл бұрын

brilliant explanation

@jnyfah 3 жыл бұрын

Spot on!!

@elvissam1401 3 жыл бұрын

Muchas gracias, Dios te bendiga.

@alamusneha9772 3 жыл бұрын

Thanks for helping out

@ZaaachG18 4 жыл бұрын

This was super helpful for me. The delimiter part was clutch.

@varunmodak6100 4 жыл бұрын

Yo this video was so detailed and well explained. Looked so long for a video that covers the algorithm extensively, and you do an amazing job! Thanks a ton.

@shootoshoot8685 4 жыл бұрын

thankyou for this amazing explanation 👍

@tamilcodingclub3832 4 жыл бұрын

I actually understood to some extent only in your video!

@asarpansaini 4 жыл бұрын

Sir your videos are the ones which I was searching for last 10 months...great sir Please keep on uploading such great videos

@mail2ttarun 4 жыл бұрын

Pretty awesome explanation!! And I don't think the code could be anymore concise than this.

@aloksharma4106 4 жыл бұрын

why your channal is underrated ... your way of explanation is stunning bro

@code7434 4 жыл бұрын

This idea will fail for N-ary tree

@elinxxi 3 жыл бұрын

Why? I emulate the 3-way case, looks like it works also

@waynefong5960 4 жыл бұрын

Thank you for the video. This helped me to solve one of the question in my assignment. Keep going!

@ilsunchoi3172 4 жыл бұрын

Bro. I couldn't thank you enough. It's been days to figure out how to find a node in Binary Tree. Now I used it to see it working perfectly! Thanks

@radiagulzan 4 жыл бұрын

you videos are golden!

@radiagulzan 4 жыл бұрын

thank you!

@vjunloc1 4 жыл бұрын

You are an excellent teacher, no BS, to the point and very clear. Please make more such videos

@angadjitsingh6144 4 жыл бұрын

thank you so much

@syedsaif9143 4 жыл бұрын

Hey! Thank you so much for making these vids man! I love how u use drawings to help visualize things. Don't worry about your subs or views, just keep putting out content, it'll all be of use one day.

@PhyleyCS 4 жыл бұрын

I appreciate that!

@jitendertehlan1384 4 жыл бұрын

Sir,what's the time complexity for finding height of balanced binary search tree

@PhyleyCS 4 жыл бұрын

Using the algorithm described in this video, the time complexity is O(n) (as mention at the end). This is the same no matter what the shape of the binary tree is. Therefore, the time complexity for a balanced binary search tree is still O(n).

@jitendertehlan1384 4 жыл бұрын

@@PhyleyCS ok sir,thankyou very much

@boshiij3449 4 жыл бұрын

going through the code step by step really helped me understand. Thank you so much!

Ең жақсы KZbin

Пікірлер