Question

Searching:
1. Develop a program to search an element with the worst case time complexity of O(n).
2.Develop a program to search an element with the worst case time complexity of O(log n) using recursion

Trees:
a. Show the result of inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree.

2. Develop a program that performs the following operations in a binary tree.
a. Post order
b. In order
c. Pre order

3. Develop a program to create a binary search tree dynamically with following operations

i) Insertion
ii) deletion
guyzz plz answer it faaaaast!!!!!!

Answer 1

the answer is 
2)steady state" tree
3.inserting

Answer 2

searching:
1-linear searching
2-binary searching