CSE 114 – Computer Science I Lecture 1
... – A binary tree has a left subtree & right subtree • Depth of a node – starting at a node, the number of steps up to reach the root • Depth of a tree – the maximum depth of any of its leaves ...
... – A binary tree has a left subtree & right subtree • Depth of a node – starting at a node, the number of steps up to reach the root • Depth of a tree – the maximum depth of any of its leaves ...
1 Balanced Binary Search Trees
... Exercise. Find the best c you can which satisfies the above inequalities. ...
... Exercise. Find the best c you can which satisfies the above inequalities. ...
Data Structures in Java
... nodes such that the next node in the sequence is a child of the previous ...
... nodes such that the next node in the sequence is a child of the previous ...
B+ Tree
... Start at root, find leaf L where entry belongs. Remove the entry. › If L is at least half-full, done! › If L has only d-1 entries, Try to re-distribute, borrowing from sibling (adjacent node with same parent as L). If re-distribution fails, merge L and sibling. ...
... Start at root, find leaf L where entry belongs. Remove the entry. › If L is at least half-full, done! › If L has only d-1 entries, Try to re-distribute, borrowing from sibling (adjacent node with same parent as L). If re-distribution fails, merge L and sibling. ...