29. Considering the structure of AVL trees, which tree below could NOT be an AVL tree? (d) None of the above 30. Which t

[answerhappygod]

29 Considering The Structure Of Avl Trees Which Tree Below Could Not Be An Avl Tree D None Of The Above 30 Which T 1 (40.89 KiB) Viewed 7 times

29. Considering the structure of AVL trees, which tree below could NOT be an AVL tree? (d) None of the above 30. Which tree-traversal algorithm is given by the pseudo code below? void Xtraverse(Tree t) { if (t = null) { } 거 print (t.value); Xtraverse(t.left); Xtraverse(t.cight); (a) Level-order traversal (b) Pre-order traversal (c) In-order traversal (b) (d) Post-order traversal (e) Euler Tour 31. Suppose the cost of an algorithm A is T(n)=5+n+n²+ log n. Its order of growth is: (a) logarithmic (b) linear (c) polylogarithmic (d) quadratic (e) exponential 10