1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D)All of the above
2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
PLEASE JOIN MY TELEGRAM CHANNEL
CHANNEL LINK 👇👇👇👇👇👇👇💛🙏🙏🙏
https://t.me/team_diploma_student_third_sem
IF YOU LIKE MY WEBSITE THEN
COMMENTS FAST
