1. A red-black representation of a 2-3-4 tree is unique.   True or False? 2.  A 2-3 tree implementation of a table is ______ for all table operations. A. O(n) B. O(log_2 (n)) C. O(n * log_2 (n)) D.O(n^2)

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):

Draw all possible binary search trees with the values 1, 2, 3, and 4.

= Suppose that we have a B and the size of the search key field V is equal to 10 bytes, the size of the data (record) pointer Pr 6 bytes, and the tree (block) pointer P is 5 bytes and the value of p (the order or the maximum number of a tree pointers in a node) is equal to 20 for an internal node. a) Calculate the block size (B) b) Suppose that we have a B- tree instead of B and based on the block size found in question (a), calculate the order (p) for an internal node in this case.

Question 6 In a binary search tree, if a node has a value n, all of the values in its left subtree: O are less than n O are always a queue O are negative O have no relationship to n

Programing C Just with #include Creating a Tree In this challenge, you will have to use pointers to create a tree. More specifically, the tree shown below: n1 n2 n3 n4 "end" "end" n5 "end" n6 "end" n7 "end" "end" "end" "end" "end" "end" "end" "end" "end" "end" "end" should be the same end we discussed in class for singly linked lists In other words, you will have to create structures that contain one value and three pointers. You will then have to declare your nodes and have their pointers (arrows), point to the nodes specified in the three. You will do this in the exact same way as we did with linked lists. The differences here are that you have more pointers and a different layout of the nodes. Your program should not print anything. It is merely meant to show your understanding of pointers and “nodes" (structures). Therefore, aside from the definitions of your structures, everything should be in main.

Please written by computer source