Tag: balanced trees

Episode 485: Howard Chu on B+tree Data Structure in Depth

Filed in Episodes by on November 9, 2021 0 Comments
Episode 485: Howard Chu on B+tree Data Structure in Depth

Howard Chu, CTO of Symas Corp and chief architect of the OpenLDAP project, discusses the key features of B+tree data structures, which are the default selection for efficient and predictable storage of sorted data. Host Gavin Henry spoke with Chu about B+tree data structures; why they allow searches, insertions, and deletions in logarithmic time; what […]

Continue Reading »