class Solution

fun TreeNode?.count():Int =

if(this==null) 0 else left.count()+right.count()+1

fun findNode(node:TreeNode?, x:Int): TreeNode?{

if(node == null) return null

if(node.`val` == x) return node

val left = findNode(node.left, x)

val right = findNode(node.right, x)

return if(left != null) left else right

}

fun Solution.btreeGameWinningMove(root: TreeNode?, n: Int, x: Int): Boolean {

val node = findNode(root, x)

val left = node?.left.count()

val right = node?.right.count()

val half = n/2

return left > half || right > half || left + right < half

}