Complexity Analysis of Binary Tree

Question 1

Inorder, preorder,postorder

Answer 1

In-order traversal- time complexity ->
auxilary space
O(n), O(n)
Pre-order traversal -o(n), o(n)
Post-order Traversal-same for all
Insertion(unbalanced)
Searching(unbalanced)
Deletion(unbalanced)