You are given a binary tree, with nodes as [1, 2, 3, …, k]. Two persons start to traverse trees, one from 1 and other from k, A person can visit a node only if it is not visited by both of them and the node is adjacent to a node visited by him. Find who can traverse more nodes?.
also the first person will start first then second alternatively