Consider the following tree with root value 20, 20 has a left child of 10 and a right child value 30; 10 has a left child of 5 and a right child of 15; 30 has a left child of 25 and a right child of 40; 5 has a left child of 3 and no right child; Nodes 3, 15, 25 and 40 have no children. What is the ordering for the inorder traversal? a.

20, 10, 30, 5, 15, 25, 40, 3 b.

20, 10, 5, 3, 15, 30, 25, 40 c.

3, 5, 10, 15, 20, 25, 30, 40 d.

None of the above.

Consider the following values: 20, 10, 45, 23, 46, 75, 15. What value will be at the root of the tree created by inserting these values in the order given to build an AVL Tree? a.

10 b.

23 c.

45 d.

20

"Get 15% discount on your first 3 orders with us"
Use the following coupon
"FIRST15"

Order Now