One complee Binary tree is there The root node is having value 1 The value of the first node in the level =1+value of the last node in the previous level The value of the first node in the level =1+value of the previous node in the same level You are given target x you have to find whether the value x is present or not in the tree if it is present find the path to it starting from the root node If not present return empty array X=10; {1,2,5,10} X=10 ;{}

Given an m x n grid of characters board and a string word, return true if word exists in the grid.