AVL Tree Defining Conditions - Qualcomm_8thaug OA Question | OAHelper

AVL Tree Defining Conditions - Qualcomm_8thaug OA Question | OAHelper

Company: Qualcomm_8thaug

Difficulty: easy

Problem Statement

Which of the statement(s) given below must be satisfied by a binary tree to become an AVL tree? I) It should be a binary search tree. II) For any node x, the height of left subtree of x and height of right subtree of x differ by at most 1. Pick ONE option Only (I) Both (I) and (II) Neither (I) nor (II) Only (II) Output Format Print the text of the correct option exactly as it appears above.

More Qualcomm_8thaug OA questions Interview experiences