Which type of binary tree traversal is typically used to delete all nodes in a BST?
Postorder traversal
Preorder traversal
Level-order traversal
Inorder traversal
How can you identify leaf nodes during a preorder traversal of a binary tree?
It is not possible to identify leaf nodes during preorder traversal.
A node is a leaf if it is visited before its children.
A node is a leaf if its value is less than its parent's value.
A node is a leaf if both its left and right child pointers are NULL.
Level Order Traversal of a Binary Tree is also known as?
Depth First Search (DFS)
Preorder Traversal
Postorder Traversal
Breadth First Search (BFS)
Which data structure is commonly used to efficiently implement priority queues due to the properties of complete binary trees?
Heap
Queue
Linked List
Stack
A full binary tree with 'k' internal nodes has how many total nodes?
k
2k + 1
2k
k + 1
Is it possible for a full binary tree to have an even number of nodes?
No
Yes
Which traversal algorithm is most suitable for finding the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree?
Level Order Traversal
Any of the above
Which of the following statements is true about AVL trees?
AVL trees are a type of Red-Black tree.
AVL trees do not require any rotations to maintain balance.
AVL trees guarantee a maximum height difference of 1 between the left and right subtrees of any node.
AVL trees are always perfectly balanced.
Inorder Traversal is particularly useful for which of the following applications?
Checking if a Binary Tree is balanced.
Printing the nodes of a BST in sorted order.
Finding the height of a Binary Tree.
Finding the diameter of a Binary Tree.
What is the relationship between the number of leaf nodes (L) and the number of internal nodes (I) in a full binary tree?
L = I
L = 2 * I
L = I + 1
L = I - 1