List of top Data Science and Artificial Intelligence Questions on Representation of Binary Tree

Given a dataset with K binary-valued attributes (where K > 2) for a two-class classification task, the number of parameters to be estimated for learning a naïve Bayes classifier is

Consider the following tree traversals on a full binary tree :
(i) Preorder
(ii) Inorder
(iii) Postorder
Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree ?

Let h₁ and h₂ be two admissible heuristics used in A* search.
Which ONE of the following expressions is always an admissible heuristic ?

Consider the following statement :
In adversarial search, α - β pruning can be applied to game trees of any depth where a is the (m) value choice we have formed so far at any choice point along the path for the MAX player and ẞ is the (n) value choice we have formed so far at any choice point along the path for the MIN player.
Which ONE of the following choices of (m) and (n) makes the above statement valid ?