DSA + System design - 14

What is the time complexity of inserting a node in an AVL tree?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a Binary Search Tree (BST), which traversal method would give nodes in ascending order?

• Pre-order

• In-order

• Post-order

• Level-order

What is the maximum number of nodes in a binary tree of height hhh?

• 2^h + 1

• 2^(h+1) + 1

• h^2

• 2^h

In a full binary tree, how many leaves are there if there are nnn internal nodes?

• n

• n+1

• 2n

• 2n+1

What is the height of a complete binary tree with n nodes?

• logn

• log(n+1)

• ⌊logn⌋

• ⌈log(n+1)⌉−1

Which of the following is a property of red-black trees?

• Every leaf is red

• No two red nodes are adjacent

• Every root is red

• All nodes are red

What is the time complexity of searching for a node in an unbalanced Binary Search Tree (BST) with nnn nodes in the worst case?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which traversal method is used to get the nodes of a BST in non-decreasing order?

• Pre-order

• In-order

• Post-order

• Level-order

Which of the following operations can convert any binary search tree into its mirror image?

• In-order traversal

• Pre-order traversal

• Post-order traversal

• Level-order traversal

Given a BST, which node has the largest value that is smaller than a given node?

• Root node

• In-order predecessor

• In-order successor

• Leaf node