1. Assume i have an avl tree and i want to search it for the number 35. W either c++ code or pseudocod the tree. 1. E, to perform the search and to inform me

2. Use the following tree to answer all questions:

(a) how many internal nodes are there?

(b) how would the positions be accessed for a post-order traversal

(c) what is the difference between height and depth? Explain usir

(d) what specialization of a binary tree is represented here?

(e) in o notation, how long is the worst case scenario to find a no