Which of the following is a valid binary search tree? O

Which of the following is the implementation of the ternary tree?a) AVL Treeb) Ternary Heapc) Hash Tabled) Dictionary

Which of the following represents the tree below correctly? ("/" represents empty node)       A B C D E       A B / C D /   E       A B   / C / D E       A B C   /  /  D E

Which is preferable: the normal binary tree or the advanced binary search tree in this case?

Which of the following is an inorder traversal of the tree below?        A. 20, 50, 90, 150, 175, 200   B. 200, 175, 150, 90, 50, 20

12:34 A cs61a.org Implement add_d_leaves, a function that takes in a Tree instance t and a number v. We define the depth of a node in t to be the number of edges from the root to that node. The depth of root is therefore 0. For each node in the tree, you should add d leaves to it, where d is the depth of the node. Every added leaf should have a label of v. If the node at this depth has existing branches, you should add these leaves to the end of that list of branches. For example, you should be adding 1 leaf with label v to each node at depth 1, 2 leaves to each node at depth 2, and so on. Here is an example of a tree t (shown on the left) and the result after add_d_leaves is applied with v as 5. 3 2 3 2 4 4 5 5 5 Hint: Use a helper function to keep track of the depth! def add_d_leaves(t, v): """Add d leaves containing v to each ng