What is the worst-case time complexity of inserting a node into a Binary Search Tree (BST)?
O(1)
O(log n)
O(n)
O(n log n)
What is the maximum number of nodes at level 'l' in a binary tree?
2l
2^l
l
l^2
What is the time complexity of finding all root-to-leaf paths in a Binary Tree?
O(n^2)
What is the difference between the height and depth of a node in a binary tree?
Height is always one more than the depth of a node.
Height is the number of edges from the root to the node, while depth is the number of nodes from the root to the node.
Height is the number of edges from the node to the deepest leaf, while depth is the number of edges from the root to the node.
Height and depth are the same thing.
What is the space complexity of finding the LCA in a Binary Tree using a recursive approach?
What is the time complexity of finding the LCA in a Binary Search Tree (BST) in the worst case?
What is the difference between Postorder and Inorder Traversal?
Postorder visits the left subtree, then the right subtree, and finally the root, while Inorder visits the left subtree, the root, and then the right subtree.
Postorder is used for deleting nodes in a Binary Tree, while Inorder is used for printing the nodes in sorted order.
Postorder visits the root node before its children, while Inorder visits the root between its left and right children.
There is no significant difference; both traversals produce the same output.
Which data structure is commonly used to efficiently implement priority queues due to the properties of complete binary trees?
Linked List
Queue
Stack
Heap
Red-Black trees introduce the concept of 'color' to nodes (red or black). What is the primary purpose of this color scheme?
To enforce a specific order of nodes during insertion
To simplify the visualization of the tree structure
To enable efficient searching for nodes based on their color
To maintain a relaxed form of balance, allowing for faster insertion and deletion compared to strictly balanced trees
Preorder Traversal is often used as a step in which of the following tasks?
Checking if two Binary Trees are mirrors of each other.
Creating a deep copy of a Binary Tree.
Level order traversal of a Binary Tree.
Finding the Lowest Common Ancestor (LCA) of two nodes.