Question

height of binary search tree in worst case

Answer 1

Answer:

height of binary tree in worst case is n-1...one node on each level

Answer 2

n a tree, the worst case runtime is dependent on the height of the tree. Since a binary search tree is not guarenteed to be balanced in any way, the worst case height of a tree with n nodes is n-1. Therefore, the worst case run time for insert is O(n).