OPTION CHOICES FOR EACH 1. Yes No, BST ordering property violated by 20 and 40 No. BST ordering property violated by 20 and 30 No, 40 has invalid AVL balance property No. 20 has invalid AVL balance property 2. Yes. No. BST ordering propertv violated by 60 and 70 No, BST ordering property violated by 50 and 60 No, 60 has invalid AVL balance property No. 50 has invalid AVL balance property 3. Yes No. BST ordering property violated by 20 and 40 No. BST ordering property violated by 20 and 30 No, 60 has invalid AVL balance property No. 20 has invalid AVI balance property 4.
OPTION CHOICES FOR EACH
1.
Yes
No, BST ordering property violated by 20 and 40
No. BST ordering property violated by 20 and 30
No, 40 has invalid AVL balance property
No. 20 has invalid AVL balance property
2.
Yes.
No. BST ordering propertv violated by 60 and 70
No, BST ordering property violated by 50 and 60
No, 60 has invalid AVL balance property
No. 50 has invalid AVL balance property
3.
Yes
No. BST ordering property violated by 20 and 40
No. BST ordering property violated by 20 and 30
No, 60 has invalid AVL balance property
No. 20 has invalid AVI balance property
4.
Yes.
No. BST ordering property violated by 70 and 80
No BST ordering property violated by 60 and 70
No. 70 has invalid AVL balance property
No 60 has invalid AVI balance property
Let's evaluate each tree for BST (Binary Search Tree) and AVL (Adelson-Velsky and Landis) properties:
Step by step
Solved in 3 steps
