Why use binary search if there’s ternary search?

by

Actually, people do use k-ary trees for arbitrary k.

This is, however, a tradeoff.

To find an element in a k-ary tree, you need around k*ln(N)/ln(k) operations (remember the change-of-base formula). The larger your k is, the more overall operations you need.

The logical extension of what you are saying is “why don’t people use an N-ary tree for N data elements?”. Which, of course, would be an array.

More Related Contents:

  1. Find kth smallest element in a binary search tree in Optimum way
  2. Skip List vs. Binary Search Tree
  3. How to create the most compact mapping n → isprime(n) up to a limit N?
  4. Reverse the ordering of words in a string
  5. Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations
  6. Data structures for loaded dice?
  7. How to implement a binary tree?
  8. How to implement a queue using two stacks?
  9. How to find the lowest common ancestor of two nodes in any binary tree?
  10. Heap vs Binary Search Tree (BST)
  11. Computing set intersection in linear time?
  12. How to delete in a heap data structure?
  13. What is the difference between tree depth and height?
  14. How Do I Choose Between a Hash Table and a Trie (Prefix Tree)?
  15. O(klogk) time algorithm to find kth smallest element from a binary heap
  16. In Order Successor in Binary Search Tree
  17. Hashing a Tree Structure
  18. What is the advantage to using Bloom filters?
  19. How to determine if binary tree is balanced?
  20. Why does Dijkstra’s algorithm use decrease-key?
  21. How can I return an array of struct in solidity?
  22. Search a sorted 2D matrix [duplicate]
  23. The intersection of all combinations of n sets
  24. Why increase pointer by two while finding loop in linked list, why not 3,4,5?
  25. Why are hash table expansions usually done by doubling the size?
  26. Algorithm for merging two max heaps?
  27. What are probabilistic data structures?
  28. How to find the number of different shortest paths between two vertices, in directed graph and with linear-time?
  29. Why is vector array doubled?
  30. How to apply binary search O(log n) on a sorted linked list?

Leave a Comment