Trees In Data Structures - Study Mode
[#106] How do you determine if a binary tree is a binary search tree?
Correct Answer
(A) By checking if each node's left children are smaller and right children are larger.
[#107] What is the main advantage of using a Red-Black Tree over a regular binary search tree?
Correct Answer
(A) It guarantees O(log n) time complexity for insertion, deletion, and search operations.
[#108] In a binary tree, which type of node traversal will visit nodes in increasing order?
Correct Answer
(A) Inorder
[#109] In a complete binary tree, which property holds true?
Correct Answer
(A) All levels are completely filled except possibly the last level, which is filled from left to right.
[#110] What is the height of a complete binary tree with n nodes where n is a power of 2?
Correct Answer
(A) log2(n)