Please solve these question (True or False)

rark each of the following statements TRUE (T) or FALSE (F). Note: "I" means a statement is always true. If a statement is not always true, markit " F ". a. For a binary search tree with n nodes, where n>0 and n=2m+1 (i.e. n is odd), an in-order tree trayersal processes the root node's data after processing the data of m other nodes, and before processing the data of m other nodes. 0. [ Using the array representation of a binary tree, any binary tree of size n can be stored in an ] cc. Any recursive function can be implemented without recursion by using a stack. d. A single rotation of nodes in a binary search tree will restore the balance of each node in the involyed sub-tree to zero