Which is something you would not use a stack for? Depth First Search Backtracking (i.e., edit -> undo) Reversing a word Breadth First Search Which of the following statement is FALSE about a binary search tree? The right child is always greater than its parent The left and right sub-trees should also be binary search trees None of the mentioned The left child is always lesser than its parent Which of the following statement is "true"? A root node is the basic unit of linked list. A node has two components, including data and pointer. In a single linked list, the pointer of the last node points to the (head) first node. In a single linked list, a node can be searched starting from the tail (last node) to the head (first node) The time complexity to count the number of elements in the linked list is O(n).