MCQs
Total Questions : 12
| Page 2 of 2 pages
Answer: Option A. -> when both left, right nodes are having null pointers and only right node is null pointer respectively
They are properties of double and single threaded binary trees respectively.
Answer: Option A. -> all basic operations and set intersection, set union and subset test
The specialty of a weight balanced tree is a part from basic operations we can perform collective operations like set intersection,
which helps in rapid prototyping in functional programming languages.