Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Tree (data structure)

Related lectures (30)

Explores wood properties, benefits of building with wood, tree structure, and microstructure.

Explains the reference implementation for a concurrent stack and the importance of handling concurrency issues.

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.

Introduces structural induction on trees, demonstrating with IntSets and their laws.

Covers procedural and object-oriented programming, abstract data structures, templates, and the C++ standard library.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.

Introduces parallel scan left in Scala, covering its properties, sequential solutions, and efficient parallel computation techniques.

Covers intermediate JavaFX concepts, focusing on scene graph and appearance.

Offers a hands-on demonstration of the Gemini-SEM 300, covering 3D imaging, EDX analysis, and specimen mapping.

Covers the Chord algorithm for search and routing in distributed hash tables.

Covers B+ Trees, a key data structure for efficient indexing in databases.

Covers abstract data structures and the C++ standard library, including linked lists, stacks, queues, and complex numbers.

Explores the performance of soft-output linear detection in wireless communication systems and the complexity of MIMO detection algorithms.

Presents PAX, a hybrid solution for efficient data storage, and Parquet, a columnar storage format for Hadoop.

Explains the Branch and Bound algorithm for heuristic maximization problems using LP relaxations and pruning techniques.

Explores tree-structured indexing with a focus on B+ trees in databases.