Data structures playlist: • Data Structures with T... Code repository: github.com/jef... Queue source code: github.com/jef... Diagrams from Keith Schwarz: web.stanford.e...
Great video! I am studying Advanced Algorithm now and encountered this data structure. I have gone through a lot of documentations and videos and you are the best!
How is looking up a value in binary heap takes a constant time? Don’t we have to go through all the heap nodes to check if the node exists? Can anyone explain me that?
Great video. But at minute 27:54 you showed an ASCII representation of a tree and I was wondering if it's allowed for A to have two children with a rank of one (C and E) or if I missed something there. Thank's in advance and keep up the good work.
