 |  Trees 24 Flashcards |  Start |
 | What is the maximum number of nodes at level 'l' in a binary tree? |  Card: 1 / 24 |
| 2^l | Card: 2 / 24 |
| Which of the following statements is true regarding binary trees? A) Every node has at most one child. B) Every node has at most two children. C) Every node can have any number of children. D) None of the above. | Card: 3 / 24 |
| B) Every node has at most two children. | Card: 4 / 24 |
| Riddle: I can be used to represent hierarchical data, and I have nodes with parents and children. What am I? | Card: 5 / 24 |
| Tree | Card: 6 / 24 |
| True or False: In a binary tree, the height of the tree can be defined as the maximum number of edges from a leaf node to the root node. | Card: 7 / 24 |
| True | Card: 8 / 24 |
| Fill in the blank: A binary tree where every node has either 0 or 2 children is called a ______. | Card: 9 / 24 |
| Full Binary Tree | Card: 10 / 24 |
| What is the formula for the minimum possible height of a binary tree with N nodes? | Card: 11 / 24 |
| Log₂(N + 1) - 1 | Card: 12 / 24 |
|  Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only | |
| Which type of binary tree has all levels completely filled except possibly the last level? | Card: 13 / 24 |
| Complete Binary Tree | Card: 14 / 24 |
| True or False: A degenerate tree behaves like a linked list. | Card: 15 / 24 |
| True | Card: 16 / 24 |
| What is the relationship between the number of leaf nodes (L) and internal nodes with two children (T) in a binary tree? | Card: 17 / 24 |
| L = T + 1 | Card: 18 / 24 |
| Fill in the blank: A binary tree is balanced if the height of the tree is O(______n). | Card: 19 / 24 |
| Log | Card: 20 / 24 |
| Which data structure is used to implement priority queues efficiently? | Card: 21 / 24 |
| Binary Heap | Card: 22 / 24 |
| What is the time complexity for search operations in a balanced binary search tree? | Card: 23 / 24 |
| O(log n) | Card: 24 / 24 |
| Completed! Keep practicing to master all of them. |  Restart |
