What are the three main methods for traversing a binary tree?
Ascending, Descending, Random
Breadth-first, Depth-first, Level-order
Linear, Binary, Exponential
Preorder, Inorder, Postorder
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 smallest key in the right subtree
The node with the largest key in the left subtree
A new node with the average key of its children
In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
The position depends on the specific implementation
As the left child of the leftmost node
As the right child of the rightmost node
As the new root
A node's direct descendant in a binary tree is called its:
Child
Ancestor
Parent
Sibling
Which of these data structures can be used to efficiently determine if a given binary tree is a valid BST?
Heap
Queue
Both Queue and Stack
Stack
What is the size of a binary tree with only a root node?
Undefined
0
1
2
Which traversal technique is typically used to find the minimum element in a binary search tree?
Preorder Traversal
Postorder Traversal
Level Order Traversal
Inorder Traversal
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
Checking the BST property locally during the insertion or deletion process
Performing a full tree traversal after every operation
It's not possible to ensure validity during the operations themselves.
What is the process of adding a new node to a binary tree called?
Searching
Insertion
Deletion
Traversal
Which traversal method on a BST will visit the nodes in ascending order of their keys?
In-order Traversal
Level-order Traversal
Post-order Traversal
Pre-order Traversal