Quiz 3 - 61_O

What is the process of visiting all the nodes of a binary tree in a specific order called?

• tree navigation

• node exploration

• tree traversal

• binary search

Which traversal visits the left subtree, then the root, and finally the right subtree?

• Preorder traversal

• Breadth-first traversal

• Postorder traversal

• Inorder traversal

What is the property of a min heap where the value of each node is greater than or equal to the value of its parent?

• Priority queue property

• Binary tree property

• Heap property

• Max heap property

What is the height-balanced binary search tree called?

• Red-black tree

• Linked list

• Binary heap

• AVL tree

What is a data structure that stores items in a way that searching, insertion, and deletion can be performed efficiently?

• chaotic organization

• alphabet

• random assortment

• data structure

What is the process of visiting all the nodes of a binary tree in a specific order called?

• tree traversal

• binary search

• node exploration

• tree navigation

Which traversal visits the left subtree, then the root, and finally the right subtree?

• Breadth-first traversal

• Preorder traversal

• Inorder traversal

• Postorder traversal

What is the property of a min heap where the value of each node is greater than or equal to the value of its parent?

• Max Heap Property

• Ascending Heap Property

• Min Heap Property

• Descending Heap Property

What is the height-balanced binary search tree called?

• AVL tree

• B-tree

• Red-black tree

• Binary heap

What is a data structure that stores items in a way that searching, insertion, and deletion can be performed efficiently?

• random assortment

• chaotic organization

• data structure

• alphabet