Logarithmic Structures (BST)

• Quest for better performance:

• O(n) is ok and easily acheived.

• O(1) is great but difficult to acheive

• O(lg(N)) is very good.

• By taking advantage of certain properties (mathematical order for instance) this can be acheived.