Scribd
Upload
18 views

Q9. Which of The Following Is An Appropriate Description Concerning A Binary Search Tree

Any binary tree containing the values 17, 6, 19, 3, 22, and 32 has a maximum depth of three. No matter which value is placed at the root node, "3" cannot have a left child. "3" is always at the deepest level of the tree no matter which value is placed at the root node.

Uploaded by

Marvin Marquez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Q9. Which of The Following Is An Appropriate Description Concerning A Binary Search Tree

Any binary tree containing the values 17, 6, 19, 3, 22, and 32 has a maximum depth of three. No matter which value is placed at the root node, "3" cannot have a left child. "3" is always at the deepest level of the tree no matter which value is placed at the root node.

Uploaded by

Marvin Marquez
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Q9.

Which of the following is an appropriate description concerning a binary search tree whose node values are 17, 6, 19, 3, 22, and 32? a) b) c) d) Any binary tree containing these values has a maximum depth of three (3). No matter which value is placed at the root node, 3 cannot have a left child. No matter which value is placed at the root node, 3 is always at the deepest level. The root node value cannot be 32.

You might also like