In a binary tree, what is the depth of a node?
The height of the subtree rooted at that node.
The number of children the node has.
The length of the path from the root to that node.
The number of nodes at the same level as the node.
What is the time complexity of finding the minimum value in a BST?
O(n)
It depends on the balancing of the tree.
O(log n)
O(1)
In a binary tree, where is a new node typically inserted?
Anywhere, it doesn't matter
As a leaf node
It depends on the data
As the root node
What is the maximum possible height of a balanced binary tree with 7 nodes?
3
2
7
4
In the context of binary trees, what does 'BST' stand for?
Binary Search Tree
Balanced Search Tree
Binary Sorted Tree
Basic Structure Tree
What are the three main methods for traversing a binary tree?
Breadth-first, Depth-first, Level-order
Preorder, Inorder, Postorder
Linear, Binary, Exponential
Ascending, Descending, Random
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Inorder Traversal
Postorder Traversal
Any traversal method can be used
Preorder Traversal
What is one way to check the validity of a BST during insertion or deletion operations?
Performing a full tree traversal after every operation
It's not possible to ensure validity during the operations themselves.
Checking the BST property locally during the insertion or deletion process
Maintaining a separate sorted array to compare with the BST
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n^2)
When deleting a node with two children in a BST, which node is typically chosen as its replacement to maintain the BST properties?
Either of the above options can be used
The node with the largest key in the left subtree
A new node with the average key of its children
The node with the smallest key in the right subtree