Level Order Traversal of a Binary Tree is also known as?
Breadth First Search (BFS)
Depth First Search (DFS)
Preorder Traversal
Postorder Traversal
What is the output of Preorder Traversal for the following Binary Tree: 1(2(4,5),3)?
4 2 5 1 3
1 2 4 5 3
4 5 2 3 1
1 3 2 4 5
When deleting a node with two children in a BST, which node is typically chosen as its replacement?
The leftmost child of the node's right subtree
Any leaf node in the subtree rooted at the node being deleted
The node's immediate parent
The rightmost child of the node's left subtree
Which traversal algorithm is most suitable for finding the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree?
Any of the above
Level Order Traversal
Which data structure is commonly used to efficiently implement priority queues due to the properties of complete binary trees?
Queue
Heap
Stack
Linked List
Which of the following is NOT a typical application of Binary Search Trees?
Storing and retrieving data in a specific order
Implementing sorted sets and maps
Representing a graph data structure
Finding the median of a dataset
What is the time complexity of efficiently finding the diameter of a binary tree?
O(n)
O(n^2)
O(log n)
O(n log n)
Is it possible for a full binary tree to have an even number of nodes?
Yes
No
What is the primary advantage of using a balanced BST over an unbalanced BST?
Improved worst-case time complexity for search, insertion, and deletion
Faster insertion operations
Guaranteed constant-time search complexity
Reduced memory usage
Inorder Traversal is particularly useful for which of the following applications?
Printing the nodes of a BST in sorted order.
Checking if a Binary Tree is balanced.
Finding the height of a Binary Tree.
Finding the diameter of a Binary Tree.