Trees MCQs
Solve topic-wise placement questions and improve your skills.
Preorder traversal visits the current node first, then left subtree, then right subtree.
Inorder traversal of a BST always yields keys in ascending sorted order.
At level L, the maximum number of nodes is 2^L.
An AVL tree maintains height balance where the difference between left and right subtree heights is -1, 0, or +1.
A skewed BST degenerates into a linked list, degrading search time to O(N).
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.
In a BST, traversing from root based on key comparison finds LCA in O(H) time.