title: What is the largest chromatic number of a binary tree?
body: <p>This is a Discrete Math/Combinatorics Question from my homework, but I don't really understand the question.</p>
  
  <blockquote>
    <p>Find largest chromatic number of a full binary tree given the following depths:
    (Check all that apply)</p>
    
    <p>2, 3, 7, 12, 200</p>
  </blockquote>
  
  <p>I understand that the chromatic number refers to the minimum color that you can color a graph or tree with the adjacent nodes or vertices being different colors.</p>
  
  <p>So knowing this fact, I'm sure that the chromatic number for all full binary trees should be 2 since you can use two different color nodes to complete the tree. But they want me to find the largest chromatic number, which confuses me.</p>
  
  <p>Am I missing something?</p>