Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Binary Search Trees in Encyclopedia
#1
In the Encyclopedia of Elementary Data Structures link from the beastie website, if one navigates to the section regarding Binary Search Trees, there is no information about the "find" operation. The "delete" operation is also ambiguous, and basically empty. Does anyone know the best/average/worst case time complexities for these operations?
Reply
#2
If you do not know if the tree is balanced, then find takes linear time (since the tree might be skewed completely left or right or be linear in some other fashion).

The same is true for delete.
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)