answer

puestion 1 Part I/ Boolean (4 marks) Answer either True or False for each of the following four statements. a) Stacks and queues are really special cases of the List class b) The AVL and splay trees are special cases of the binary search tree c) The maximum depth of a splay tree on n nodes is n-1 d) The minimum depth of a splay tree on n nodes Is. puestion 1 Part I/ Boolean (4 marks) Answer either True or False for each of the following four statements. a) Stacks and queues are really special cases of the List class b) The AVL and splay trees are special cases of the binary search tree c) The maximum depth of a splay tree on n nodes is n-1 d) The minimum depth of a splay tree on n nodes Is