Match the following and select the correct option. Height of Binary search tree(in worst o([log ]-1)...

Transcribed Image Text:

Match the following and select the correct option. Height of Binary search tree(in worst o([log ]-1) 1 a (2n+1) case) Height of Ternary tree b O(n) Height of B-tree(when c minimum degree, -2) (log, (n)) 3 4 Height of red-black d n+1 O log, 2 tree а) 1-b,2-а,3-d,4-с b) 1-c,2-d,3-a,4-b c) 1-c,2-d,3-b,4-a d) 1-d,2-a,3-d,4-a Match the following and select the correct option. Height of Binary search tree(in worst o([log ]-1) 1 a (2n+1) case) Height of Ternary tree b O(n) Height of B-tree(when c minimum degree, -2) (log, (n)) 3 4 Height of red-black d n+1 O log, 2 tree а) 1-b,2-а,3-d,4-с b) 1-c,2-d,3-a,4-b c) 1-c,2-d,3-b,4-a d) 1-d,2-a,3-d,4-a

Answer rating: 100% (QA)

Ans is option A 1 height of binary sea... View the full answer