B-tree

Formal sciences
Theoretical computer science
Algorithms and data structures
Data structures

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 2 of 3

Information Retrieval Indexing: Part 1

Explores text retrieval systems, inverted files, addressing granularity, and access structures in information retrieval.

Binary Search Trees Operations

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Decision Tree Classification

Covers decision tree classification using KNIME Analytics Platform for data preprocessing and model creation.

Wood Properties

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

Safe Mutation in Scala

Explores safe mutation in Scala, emphasizing the management of mutable state and its significance in interactions, modeling, and implementation efficiency.

Branch and Bound: Heuristic Maximization

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

Binary Search Trees: Operations and Procedures

Covers operations and procedures related to binary search trees, including finding successors and predecessors.

Huffman's Algorithm: Mechanizing the Proof

Explores the mechanization of Huffman's algorithm proof and functional implementation.

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.