# TreeSelect
## Data Structure

type TreeNode sturct {
    childs TreeNode[]
    parent TreeNode
    checked bool
}

## Algorithm
### Case 1: Select

func RecursiveUpSelect(node TreeNode) TreeNode{
    if node == root return
    parent = node.parent
    if isFull(parent){
        return RecursiveUpSelect(parent)
    }else{
        return node
    }
}

func isFull(node TreeNode) bool{
    for child in range node.childs {
        if !child.checked{
            return false
        }
    }
    return true
}

### Case 2: Unselect

func Unselect(node TreeNode){
    if node == root return []
    parent := node.parent
    return parent.childs
}