What is the average case time complexity for finding the height of the binary tree? Lütfen birini seçin: A. O(log n) B. O(log log n) C. O(n) D. O(n log n)

In general, in an avl tree, worst case for finding (and inserting and deleting) data takes:   (a) O(1) (b) O(n) (c) O(n log n) (d) O(n2) (e) O(log n)

Question 2 Given a Huffman code as a binary tree, show that you can decode in O(n) time.

Given an m-by-n chocolate bar, you need to break it into mn 1-by-1 pieces. You can break a bar only in a straight line, and only one bar can be broken at a time. Design an algorithm that solves the problem with the minimum number of bar breaks. What is this minimum number? Breaking the chocolate bar can be represented by a binary tree.

What is the depth of any tree if the union operation is performed by height?a) O(N)b) O(log N)c) O(N log N)d) O(M log N)