The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be ________ a) T Q R S O P b) T O Q R P S c) T Q O P S R d) T Q O S P R

The Delete algorithm for a binary search tree retrieves and deletes the inorder successor when the node being deleted has two children. In this case the inorder successor is found as: O a. the smallest value in the left subtree. O b. the largest value in the right subtree. O c. the largest value in the left subtree. O d. None of these are correct O e. the smallest value in the right subtree.

In the following binary tree (not a binary search tree) array/list representation, which value would be the parent of the 19?

In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?a) leaf to rootb) root to nodec) root to leafd) left subtree to right subtree

Please fill in the gaps and answer the questions.

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):

Binary trees are also knows as self-balanced trees.   True  False

To copy a tree, traverse the tree using an ___ traversal and add each data item visited to the new tree. inorder postorder preorder reorder