class TreeNode:

def $\_\_$init$\_\_($self$,$ name, count, parent$)$:

self.name $=$ name

self.count $=$ count

self.parent $=$ parent

self.children $=\{\}$

self.nodeLink $=$ None

def build$\_$fp$\_$tree$($updated$\_$dataset$)$:

# Input:

# $1.$ updated$\_$dataset $-$ A python dictionary containing the updated set of transactions based on the pruned support dictionary.

# Output:

# $1.$ fp$\_$tree $-$ A dictionary representing the fp$\_$tree. Each node should have a count and children attribute.

#

# HINT:

# $1.$ Loop over each transaction in the dataset and make an update to the fp$\_$tree dictionary.

# $2.$ For each loop iteration store a pointer to the previously visited node and update it's children in the next pass.

# $3.$ Update the root pointer when you start processing items in each transaction.

# $4.$ Reset the root pointer for each transaction.

#

# Sample Tree Output:

# $\{\text{'}$Y$\text{'}$: $\{\text{'}$count$\text{'}$: $3,$ 'children': $\{\text{'}$V$\text{'}$: $\{\text{'}$count$\text{'}$: $1,$ 'children': $\{\}\}\}\},$

# $\text{'}$X$\text{'}$: $\{\text{'}$count$\text{'}$: $2,$ 'children': $\{\text{'}$R$\text{'}$: $\{\text{'}$count$\text{'}$: $1,$ 'children': $\{\text{'}$F$\text{'}$: $\{\text{'}$count$\text{'}$: $1,$ 'children': $\{\}\}\}\}\}\}\}$