me with this question: Data & Structures Transcribed Image Text: Consider the diagram below, answer succeeding questions:
Tree
Pointer Pointe
M
Pointer Polnter
F
Pointer Peiote
R
ointer Pointer
NULL
Pointer Peinter
NULL
NULL
NULL
NULL
NULL
— What is the data type of the value part of the node?
— How many pointer variables are needed for each node?
— (T/F) In order to define each node in a binary tree you will need a class.
— (T/F) All pointers pointing to NULL are leaf nodes.
— To what data value is the root pointing?
— (T/F) If the left pointer of a node is NULL, it means it has a child.
— (T/F) A node may have both of its pointers NULL.
— (T/F) If I will be searching for the value P, I need to traverse the entire tree.
— (T/F) If a new node is added to the binary tree, the root will adjust and point to the new node.
— (T/F) The first value that will be added to the binary tree will automatically become the root node.
Order an Essay Now & Get These Features For Free:
Turnitin Report
Formatting
Title Page
Citation
Outline
