A strictly binary tree with 8 leaves will have nodes. O a. 7 O b. 15 O c. 255 O d. None of these Nodes that are not having any child are called as O a. Leaf Node O b. All of the above O c. External Node O d. Terminal Nodes Which one of the following is inappropriate about a Tree Data Structure? O a. It can be used to represent hierarchical data O b. It is a Non-Linear Data Structure O c. Every data item in a tree is known as node. O d. A node must be of Integer type Which one of the following statement holds false for DFS Algorithms? O a. DFS uses Backtracking technique O b. DFS is a recursive algorithm O c. It involves exhaustive searches of all the nodes by going ahead, if possible, else by backtracking. O d. It proceeds in a hierarchy. Select a statement that holds false for a Binary Search Tree. O a. The value(s) in the right child or right sub tree is larger than the value of the root node. O b. Root value is always greater than left and right child. O c. If there exists a left child or left subtree then its value is less than the value of the root. O d. All the node values in a binary search tree must be unique