Share
Explore BrainMass

Binary Tree Worse Case Input Scenario

We know that binary trees are O(n) for these dictionary operations...
What is the worst case input scenario for each operation (i.e. a list of numbers in reverse order...)

Binary Tree
-------------
Mininum - ?
Maximum - ?
Search - the tree is unbalanced (resembles a linked list)
Successor - the tree has one node on left subtree and resembles a linked list on right subtree .
Predecessor - ?
Insert - insert a key that is greater than the max value of the tree
Delete - remove an key that is the max value of the tree

Solution Summary

This job highlights a worst case input scenario.

$2.19