Recent questions tagged goclasses-da-dpp

The following strings are inserted into an empty Binary Search Tree in the given order, using normal lexicographic dictionary order:$\text{Paris, London, Rome, Vienna, Du...

Assume height is counted as the number of nodes on the longest root-to-leaf path.A Binary Search Tree contains exactly $403$ nodes.Which option gives the minimum possible...

Which of the following statements about Binary Search Trees is correct?If $\texttt{y}$ is in the left subtree of node $\texttt{x}$, then $\texttt{y.key >= x.key}$. If $\t...

The postorder traversal of a binary search tree is:$\text{1, 12, 4, 22, 18, 16}$What is the new postorder traversal after inserting $10$ and $14$ into the BST?$\text{1, 1...

A binary tree has:Left subtree containing $1000$ nodes Right subtree containing $100$ nodesHow many nodes are processed before the root in preorder, inorder, and postorde...

A binary tree has the following traversals:Preorder traversal $: \text{A M P K L D H T}$ Inorder traversal $:\text{P M L K A H T D}$Which of the following is the postorde...

Consider the following binary tree:Which option correctly gives the preorder, postorder, inorder, and level-order traversals?Preorder $:\texttt{9 15 23 12 8 6 2 7 10 5 35...

Consider the following binary search tree:If we traverse the tree in postorder and print only the key values that are greater than $12$ and less than $20$, what will be t...

A node of a binary tree is called nearly balanced if one of the following holds:The node is a leaf. The node has one child and that child is a leaf. The node has two chil...

A complete binary tree is stored in an array using $\mathbf{1}$-based indexing, where the root is stored at index $1$.For a node stored at index $11$, which of the follow...

A binary tree has height $4$, where height is measured as the maximum number of edges from the root to a leaf.Can such a binary tree have exactly $8$ leaves?Yes, because ...

Is it possible to construct a full binary tree with exactly $8$ internal nodes and $7$ leaves?Yes No

Consider the following dictionary:goals = {"Country":{"Ronaldo":123,"Messi":103,"Pele":83}, "Club":{"Ronaldo":[512,51,158],"Pele":[604,49,26]}}Which of the following stat...

Assume there are $n$ elements in the data structure. Consider the following statements:$\text{S1}:$ A stack can be implemented using a linked list such that each individu...

A queue follows FIFO order. Consider the following operations on an initially empty queue:q = [] q.append("A") q.append("B") q.append("C") x = q.pop(0) q.append("D") y = ...

A queue is to be implemented using two stacks and only a constant amount of extra memory. Which of the following correctly implements queue behavior with constant amortiz...

Give the running time of each operation in the following queue class, where the item most recently inserted is at $\texttt{_a[0]}$.class Queue: def __init__(self): self._...

Give the running time of each operation in the following queue class, where the item least recently inserted is at $\texttt{_a[0]}$.class Queue: def __init__(self): self....

Suppose a client performs an intermixed sequence of $\texttt{enqueue}$ and $\texttt{dequeue}$ operations on a queue. The enqueue operations put the integers $0$ through $...

Consider the following postfix expression:$\texttt{1 2 3 + 4 5 * * +}$Which of the following fully parenthesized infix expressions is equivalent to it?$\texttt{( 1 + ( ( ...

Consider the following prefix expression:$\texttt{+ * 2 3 / 8 4}$Which of the following is its correct postfix form?$\texttt{2 3 * 8 4 / +}$$\texttt{+ * 2 3 / 8 4}$$\text...

For the expression:$\texttt{2 * 3 + 8 / 4}$Assume the expression tree has $\texttt{+}$ as the root, $\texttt{*}$ as the left subtree root, and $\texttt{/}$ as the right s...

Evaluate the following postfix expression:$\texttt{3 4 5 + *}$Enter the numerical value.

Convert the following fully parenthesized infix expression into postfix form:$\texttt{( 2 + ( ( 3 + 4 ) * ( 5 * 6 ) ) )}$Which of the following is the correct postfix exp...

Consider the following Python code fragment:stack = [] while len(q) 0: stack.append(q.pop(0)) while len(stack) 0: q.append(stack.pop())Here, $\texttt{q.pop(0)}$ removes...

Consider the following stack-based Python code:stack = [] n = 50 while n 0: stack.append(n % 2) n = n // 2 while len(stack) 0: print(stack.pop(), end="")What is printed...

A stack is used to check whether parentheses, braces, and brackets are properly balanced.Consider the following two inputs:Input $1: \texttt{[()]\{\}\{[()()]()\}}$Input $...

Suppose an intermixed sequence of stack push and pop operations is performed. The push operations push the integers $0$ through $9$ in order. The pop operations print the...

A stack client reads tokens from left to right. If the token is a word, it is pushed onto the stack. If the token is $\texttt{-}$, one item is popped and printed.Consider...

Which of the following expressions correctly describe $\mathrm{T}(n) = n^2 \log n$?Select all that apply.$\mathrm{O}(n^2)$$\mathrm{\Theta(n^2)}$$\mathrm{\Omega(n^2)}$$\ma...