29. A binary search tree where each node has either 0 or 1 subtrees is said to be a. Perfect b. Balanced C. Degenerate d

[answerhappygod]

29 A Binary Search Tree Where Each Node Has Either 0 Or 1 Subtrees Is Said To Be A Perfect B Balanced C Degenerate D 1 (92.48 KiB) Viewed 36 times

29. A binary search tree where each node has either 0 or 1 subtrees is said to be a. Perfect b. Balanced C. Degenerate d. Complete 30. A binary search tree where the nodes at all levels except the lowest are filled, and at the lowest level, the values are filled from left to right is said to be a. Perfect b. Balanced C. Degenerate d. Complete 31. logic_error, runtime_error, syntax_error and bad_cast are all examples of standard C++ exceptions. a. True b. False 32. All standard exceptions in C++ are derived from the exception class. a. True b. False 33. User defined exception classes can be created by deriving the class from the exception class and overriding the "error_message" function. a. True b. False 34. A data structure where elements are processed in the same order in which they are added to the container is known as a a. Stack b. Queue C. Linked list d. Deque 35. A data structure where elements are processed in the opposite order in which they are added to the container is known as a a. Stack b. Queue c. Linked list d. Deque