A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called _____.Computer, Data Structure and Algorithms, Information Technology, mcqs A. AVL tree B. Red-black tree C. Lemma tree D. None of the above See Correct Answer A. AVL tree Submitted By : Ahsan Ali Soomro Share this:TwitterFacebookLinkedInTumblrPinterestPocketTelegramWhatsAppSkypeLike this:Like Loading... Related
