10.1) Is the root of a (nonempty) binary tree always, sometimes, or never a leaf
ID: 3774854 • Letter: 1
Question
10.1) Is the root of a (nonempty) binary tree always, sometimes, or never a leaf? Explain. ?
10.2) What are the minimum and maximum number of siblings a node in a binary tree can have? What if the node is the root? ?
10.3) A ternary tree is just like a binary tree, but each node has three subtrees. What are the maximum and minimum number of nodes in a ternary tree of height h? ?
10.5) Can an internal node in the Questions program's decision tree have only one child? If so, is it the left or right child? If not, why not? ?
10.8) Does a depth-first or a breadth-first traversal use more memory when traversing a linear tree? ?
10.11) Which of the four traversal orders discussed in Section 10.2 is not well defined for general trees? Explain. ?
Figure 10-14. Traversing the binary tree in Eigure 10-4. Order in which Nodes are Traversal Order Visited Preorder AGEKLHIBFICJD In order GKELAFBHCJID Postorder KLEGFBJCDIHA Level order AGHEBIKLFCDJExplanation / Answer
1) Root of Non-empty binary tree is never a leaf as by definition of binary tree every node has at most two children and its a trip (L,R,R) where its Left Root right
2) Minimum number of siblings a node can have is 0 and maximum is 1 because as per explanation of binary tree everynode can have atmost two children that means maximum of 1 sibling.
3) Any teranary tree of height h can have maximum number of nodes
M(n) = (3h+1 -1)/2 nodes
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.