LeetCode 501. Find Mode in Binary Search Tree (Algorithm Explained)

Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering

[vinayjangra]

Thanku so much, i always used to think that these high rated coders will just make the problem more harder instead of explaining simply, but you proved it wrong

[sadmanabedin]

1:20, thanks a lot for writing like this. I got the logic that inorder traversal can be used. And solved it right away.

[neonanh]

Very fresh solution, btw what is the extension you used on chrome to get the dropdown selection just like were in the ide ?, that sick!

[ankitagarwal]

Thanks for sharing!! It is one of the tough questions and very less explanations with O(1) space complexity..

[xedb]

It's funny how Nick hates saying the mundane intro

[cunningham.s_law]

It feels ugly to put the max and prev as class members. Feel like they should be parameters of the traverse function.

[thomasfrimpong]

Nick you are good at this. Just take it a little slow when explaining

[aditisharma]

u did not consider a condition for the case where there are multiple modes and if it does exists in the list already!? 'cause that will give error!!

[lifeofme]

It's okay to make mistakes. Love the explanation. Good stuff

[ramazankhakimzhan]

SDU top, AND this man actually top top

[divijjain]

def not an easy question if you do it with O(1) space

[QEats]

the intro gave me very big cocaine vibes lol

[sharangkulkarni]

explanation incomplete please explain inorder succesor and predecessor

[mohammadyahya]

what if you have after 30 to left 25? it will be 30->25->20, would your algorithm work please?

[joecamroberon]

For anyone watching, you can change the last four lines of code in the findMode method to:
return modes.toArray(new int[modes.size()]);

[Revitalish]

Gosh Nick you're really cranky in this vid LOL

[g_]

using the names of the variables as freq and maxFreq will make more sense here instead of count and max

[chiragchatwani]

Hey Why did you declared prev as Integer instead of primitive type

[sounavapal]

Pass an array with every node, for every node insert the node value in the array. Inside main, sort the array and find the mode.

[omkarnath]

i think this will fail for [1, null, 2] input, it give output [2] but the output should be [1, 2] ... also need to add this check before prev != null ....

if (prev == null && modeCount == 0) {
modeCount = 1;
}