Basic Algorithms and Data Structures: AVL tree, Binary Search Trees, Arrays, B Trees, Linked Lists, Stacks and HashMaps
InstructorHolczer Balazs
Free
The curriculum includes detailed implementations of complex structures such as AVL, Red-Black, and Splay trees.
Specific sections are dedicated to interview questions following the study of arrays, linked lists, and heaps.
Editorial course preview
These 4 complementary views highlight concrete, legible examples from the course presentation.
A desktop monitor displays Java source code implementing linked list traversal and insertion methods, accompanied by the course title Arrays and Lists.
This visual aid illustrates the concept of a stack abstract data type using a vertical arrangement of numbered blocks on a computer screen.
A computer screen displays a visual representation of a binary search tree structure with numbered green nodes, accompanied by text explaining how tree structures achieve O(logN) running time complexity.
This slide introduces the concept of Associative Arrays in Java, highlighting how key-value based data structures can achieve O(1) constant-time performance.
The curriculum does not cover advanced dynamic programming problems, which may limit those seeking higher-level algorithmic training. Note that this signal predates the displayed update; while the update label may have addressed it, it does not prove a correction.
One signal indicates the instructor may speak at a fast pace, potentially requiring playback speed adjustments. Note that this signal predates the displayed update; while the update label may have addressed it, it does not prove a correction.
The curriculum aligns with the goal of providing a conceptual refresher for developers and interview preparation.