CSE 214 Lecture 24: B-Trees
27 Oct 2016
School
Department
Course
Professor
Document Summary
All topics covered so far will be on the test (up to trees, probably no hashing) Exam practice questions are posted on the cse 214 website. Review session will be held on thursday (11/3) A tree can be a bst and a heap if there are only 2 nodes (including the parent). It would not be the same if there are 3 or more nodes. Everything on the left is smaller and everything on the right is larger. Order does matter just like in a binary search tree. A b-tree is a balanced multi-way search tree. A b-tree is designed to work well on magnetic disks and other direct-access secondary storage devices by minimizing disk i/o operations. A node can hold more than one item. A node can have more than 2 children. Balanced search tree is used since it is a balanced structure which would make searching faster.
