26. Advanced Data Structures (e.g., Trees, Graphs)

Try these first

1. 1.

   What is the root of a tree?

   Hint

   Think about the starting point of the tree structure.

2. 2.

   What is a leaf node?

   Hint

   Consider the end points of a tree.

3. 3.

   What does BST stand for?

   • Binary Search Tree
   • Basic Set Tree
   • Balanced Structure Tree

   Hint

   It helps in searching efficiently.

4. 4.

   True or False: A leaf node has at least one child.

   • True
   • False

   Hint

   Think about what end nodes can have.

5. 5.

   Given a binary search tree, write an algorithm to find the maximum value node.

   Hint

   Start at the root and follow the right children.

6. 6.

   Describe a real-world scenario where you would use a graph instead of an array.

   Hint

   Consider problems involving connections and paths.