What is the size of a binary tree with only a root node?
0
Undefined
1
2
What is the process of adding a new node to a binary tree called?
Traversal
Insertion
Deletion
Searching
What is the maximum number of children a node can have in a binary tree?
3
Unlimited
What is the minimum possible height of a binary tree with 5 nodes?
5
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Both Queue and Stack
Queue
Heap
Stack
What is the primary advantage of using a BST over a sorted array for storing data when frequent insertions and deletions are required?
BSTs use less memory.
BSTs are easier to implement.
BSTs offer faster search times.
BSTs handle insertions and deletions more efficiently.
What is the time complexity of inserting a node into a binary search tree in the worst case?
O(n log n)
O(n)
O(log n)
O(1)
What is one way to check the validity of a BST during insertion or deletion operations?
Maintaining a separate sorted array to compare with the BST
It's not possible to ensure validity during the operations themselves.
Checking the BST property locally during the insertion or deletion process
Performing a full tree traversal after every operation
What are the three main methods for traversing a binary tree?
Preorder, Inorder, Postorder
Linear, Binary, Exponential
Breadth-first, Depth-first, Level-order
Ascending, Descending, Random
In a binary tree, where is a new node typically inserted?
Anywhere, it doesn't matter
As a leaf node
As the root node
It depends on the data