# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def numColor(self, root: TreeNode) -> int:
res = set()
stack = [root,]
while stack:
k = stack.pop()
if k:
res.add(k.val)
if k.left:
stack.append(k.left)
if k.right:
stack.append(k.right)
return len(res)