In the context of BST insertion, where is a new node with a key smaller than all existing keys typically inserted?
As the left child of the leftmost node
As the new root
As the right child of the rightmost node
The position depends on the specific implementation
Nodes that share the same parent are called:
Siblings
Ancestors
Descendants
Cousins
To find the maximum element in a binary tree that is not a binary search tree, which traversal method is generally most suitable?
Postorder Traversal
Inorder Traversal
Any traversal method can be used
Preorder Traversal
What is the size of a binary tree with only a root node?
0
1
2
Undefined
What is one way to check the validity of a BST during insertion or deletion operations?
It's not possible to ensure validity during the operations themselves.
Performing a full tree traversal after every operation
Checking the BST property locally during the insertion or deletion process
Maintaining a separate sorted array to compare with the BST
Which data structure is commonly used to implement a binary tree?
Stack
Array
Linked List
Queue
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Level-order Traversal
In-order Traversal
Pre-order Traversal
Post-order Traversal
In a binary tree, what is the depth of a node?
The number of children the node has.
The length of the path from the root to that node.
The height of the subtree rooted at that node.
The number of nodes at the same level as the node.
Which traversal technique is typically used to find the minimum element in a binary search tree?
Level Order Traversal
What is the process of adding a new node to a binary tree called?
Searching
Traversal
Insertion
Deletion