Which traversal algorithm is most suitable for finding the Lowest Common Ancestor (LCA) of two nodes in a Binary Tree?
Preorder Traversal
Postorder Traversal
Level Order Traversal
Any of the above
What is the relationship between the depth of a node and its index in an array-based representation of a complete Binary Tree?
Depth = Index
Depth = log2(Index + 1)
Depth = Index / 2
Depth = 2 * Index
What is the space complexity of finding the LCA in a Binary Tree using a recursive approach?
O(log n)
O(n)
O(1)
O(n log n)
What is the relationship between the number of leaf nodes (L) and the number of internal nodes (I) in a full binary tree?
L = 2 * I
L = I - 1
L = I
L = I + 1
Which data structure is most suitable for efficiently finding a path with a given sum in a Binary Tree?
Stack
Heap
Queue
Hash Set
What is the time complexity of calculating the height of a binary tree?
O(n^2)
Which data structure is most suitable for implementing Level Order Traversal efficiently?
Linked List
Binary Heap
What is the output of Preorder Traversal for the following Binary Tree: 1(2(4,5),3)?
1 3 2 4 5
4 2 5 1 3
4 5 2 3 1
1 2 4 5 3
What is the time complexity of efficiently finding the diameter of a binary tree?
Level Order Traversal of a Binary Tree is also known as?
Depth First Search (DFS)
Breadth First Search (BFS)