Quiz 5 structures with correct answers 100%
Quiz 5 structures with correct answers 100% In a preorder traversal of a binary search tree, the first item printed out is always the smallest one - Correct Answer false What is the value of the following prefix expression " ++ 26 + - 1 3 2 4" ? (consider spaces between the last 4 digits. Treat them as an individual number) - Correct Answer 30 The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? - Correct Answer 2 Tree operations typically run in O(d) times where d is the number of nodes in the tree. - Correct Answer true The maximum number of nodes in a tree that has L levels is 2^L - Correct Answer false, 2^L-1 What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree? - Correct Answer O(n) In a heap, the left child of a node is always less than the right child of a node - Correct Answer False Which of the following traversal outputs the data in sorted order in a BST? Inorder Preorder Postorder Level order - Correct Answer Inorder In the following Binary Tree is not a Heap, why? - Correct Answer heap order property not satisfied
Document information
- Uploaded on
- March 26, 2026
- Number of pages
- 2
- Written in
- 2025/2026
- Type
- Exam (elaborations)
- Contains
- Questions & answers
