What are the three main methods for traversing a binary tree?
Ascending, Descending, Random
Preorder, Inorder, Postorder
Linear, Binary, Exponential
Breadth-first, Depth-first, Level-order
A complete binary tree with 'n' nodes will always have a height of:
floor(log2(n)) + 1
n/2
n
log2(n)
What is the process of adding a new node to a binary tree called?
Deletion
Searching
Insertion
Traversal
Which traversal method on a BST will visit the nodes in ascending order of their keys?
Pre-order Traversal
Post-order Traversal
Level-order Traversal
In-order Traversal
What is the time complexity of finding the minimum value in a BST?
O(log n)
O(n)
O(1)
It depends on the balancing of the tree.
The height of a binary tree with 'n' nodes is always:
Cannot be determined from the number of nodes
In a binary tree, where is a new node typically inserted?
As the root node
As a leaf node
It depends on the data
Anywhere, it doesn't matter
What is the maximum number of nodes at level 'l' of a complete binary tree?
2^(l+1) - 1
2l - 1
2^l
l
What is the worst-case time complexity for searching for a node in a balanced binary tree?
O(n^2)
If a binary tree is considered balanced, what does it imply about its left and right subtrees?
They are also balanced binary trees, and their heights differ by at most 1.
One subtree is always a mirror image of the other.
They have the same number of nodes.
They have the same height.