21. How many children can a node in a binary tree have?

  • 4
  • 2

22. Which of the following uses a FIFO approach.

  • Queues
  • Stacks
  • Lists

23. In relation to data structures what does synchronization mean?

  • Relates to a measured way of increasing the size of an object.
  • It is something to do with swimming.
  • Making a class thread safe.

24. Why do you need to implement a comparator when storing objects on a tree?

  • As a means of comparing objects so the tree knows which node to store an object on.
  • So that the compiler can know to keep the tree balanced by comparing a number of nodes.
  • To ensure that values don’t clash when being added to a tree.

25. Why are heaps called heaps?

  • The organization of their data is done in a very loose way, so it is said that the elements are heaped together.
  • The order of importance is determined by where in the data structure the information is found.
  • Because they store a selection of different data types.

Leave a Reply