AlgoFlow — Algorithms, Visualized

treebalancedmultiway

Press play to start

1int bplus_search(BNode* root, int val) {
  BNode* curr = root;
  while (!curr->is_leaf) {
      int i = 0;
      while (i < curr->n && val >= curr->keys[i]) i++;
      curr = curr->children[i];
  }
  for (int i = 0; i < curr->n; i++)
      if (curr->keys[i] == val) return 1;
  return 0;
11}

Step 1/0

Practice

LeetCode·#938 Range Sum of BSTEasy

Operation	Best	Average	Worst
search	O(log n)	O(log n)	O(log n)
insert	O(log n)	O(log n)	O(log n)
scan	O(log n + k)	O(log n + k)	O(log n + k)

SpaceO(n)