Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 8, Problem 1R
Explanation of Solution
a.
Root node:
- Root node means highest node in the tree structure, and has no parent.
- According to the Figure 8.3, the root node is “/user/rt/courses/”, because it is the highest node in the tree structure.
Explanation of Solution
b.
Internal node:
- Internal node means any node of a tree which has child nodes. It is lso known as an inner node, or branch node.
- According to the Figure 8.3, the internal nodes are “/user/rt/courses/”, “cs016/”, “cs252/”, “homeworks/”, “programs/”, “projects/”, “papers/”, and “demos/” because, they are the internal nodes in the given Tree.
Explanation of Solution
c.
Descendant node:
- Descendant node of a node is any node in the path from that node to the leaf node. The immediate descendant of a node is the “child” node.
- According to the Figure 8.3, the descendant node of “cs016/” contains are “grades”, “homeworks/”, “programs/”, “hw1”, “hw2”, “hw3”, “pr1”, “pr2”, and “pr3”.
- Therefore, the total number of descendant node of “cs016/” contains 9.
Explanation of Solution
d.
Ancestor node:
- An ancestor node of a node is any node in the path from that node to the root node. The immediate ancestor of a node is the “parent” node.
- According to the Figure 8.3, the ancestor node of “cs016/” is “/user/rt/courses/”.
- Therefore, the total number of ancestor node of “cs016/” contains 1.
Explanation of Solution
e.
Siblings of node:
- Sibling of nodes is nodes on the same hierarchical level under the same parent node.
- According to the Figure 8.3, the siblings of node “homeworks/” are “grades/” and “programs/”.
Explanation of Solution
f.
Subtree:
- Subtree of the node is defined as a tree which is a child of a node.
- According to the Figure 8.3, the subtree rooted at node “projects/” are “papers/”, and “demos/”.
Explanation of Solution
g.
Depth of node:
- The depth of a node is the number of edges from the node to the tree’s root node.
- According to the Figure 8.3, the depth of node “papers/” are 2 they are “buylow” and “sellhigh”.
Explanation of Solution
h.
Height of a tree:
- The height of a node is the number of edges on the longest path from the node to the leaf.
- According to the Figure 8.3, the height of a tree is 4.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Refer to the tree on the picture and answer the following questions
1. Aside from its children, list 2 other descendants of node C. Your answer must be values that are adjacent when the nodes are arranged alphabetically in ascending order. For example, the descendant nodes are: ABX Y. You cannot answer A X since you have skipped B and B Y since X has been skipped. *
2. What is the path from node A to node L? *
3. What is the length of the path from node C to node N? Note: answer with the number's symbol and not the word form of the number.*
4. List 2 nodes that are at level 2 of the tree. Your answer must be values that 1 point are adjacent when the nodes are arranged alphabetically in ascending order. For example, the nodes at a certain level are: A B X Y. You cannot answer A X since you have skipped B and B Y since X has been skipped. *
5. What is the height of the tree? Note: answer with the number's symbol and not the word form of the number.*
6. What is the height of node C? Note:…
Answer the following questions about treeB.
a. What is the height of the tree?
b. Which nodes are on level 3?
c. Which levels have the maximum number of nodes that they could contain?
d. What is the maximum height of a binary search tree containing these nodes? Draw such a tree.
e. What is the minimum height of a binary search tree containing these nodes? Draw such a tree.
f. What is the order in which the nodes are visited by an ignorer traversal?
g. What is the order in which the nodes are visited by a preorder traversal?
h. What is the order in which the nodes are visited by a postorder traversal?
Suppose the following values are inserted into a binary tree, in the order given:
12, 7, 9, 10, 22, 24, 30, 18, 3, 14, 20
Draw a diagram of the resulting binary tree.
How would the values in the tree you sketched for part a be displayed in an in-order traversal?
How would the values in the tree you sketched for part a be displayed in a preorder traversal?
How would the values in the tree you sketched for part a be displayed in a post order traversal?
Chapter 8 Solutions
Data Structures and Algorithms in Java
Knowledge Booster
Similar questions
- True or False? The number of nodes in a non-empty tree is equal to the number of nodes in its left subtree plus the number of nodes in its right subtree plus 1. please explainarrow_forwardAssume that each node in a binary tree is distinct and that you are provided both the order in which items are discovered during a preorder traversal and a postorder traversal. What are the conditions under which you can correctly reconstruct the tree structure from these two traversal orders?arrow_forwardPlease draw the following:Form a binary tree with the root node holding 20, the left and right child of the node holding 20 respectively holding 75 and 43. The next level nodes hold the data 84, 90, 57 and 71 from left to right. The node holding 84 has left and right children that respectively hold 96 and 91 and the node holding 90 has a left child that holds 93.arrow_forward
- (¢) What is a complete binary tree? What is the depth of a complete binary tree with 100 nodes? Justify.arrow_forwardShow all the possible steps that are required to solve the following questions 1.Find out the Postorder Traversal of the binary tree below? Inorder: 1 3 4 6 7 8 10 13 14 Preoder: 1 4 7 5 3 13 14 10 8arrow_forwardQuestion 9 The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2. True False Question 10 Suppose xOrder is one of our binary search tree traversal methods that is passed a tree node, node, and a queue, q. Which traversal order is provided by the following code? xOrder(node.getLeft(), q); xOrder(node.getRight(), q); q.enqueue(node.getInfo()); preorder levelorder inorder postorder None of these is correct.arrow_forward
- Explain in essay form: What is a degenerate tree? What is the cause of having a degenerate binary search tree? Why is it important for a binary tree to be balanced (or close to balanced)?arrow_forwardConsider a complete binary tree whose bottom level is completely filled. 1.If the height of this tree is h, what is the number n of nodes in this tree? 2.In terms of n, how many leaves are in this tree? 3.In terms of n or h, how many ancestors does each of the leaves in this tree have? 4.Let d be the depth of a node in this tree. In terms of d and either n or h, how many descendants does each node in this tree have?arrow_forwardYou have an ordered list ? consisting of the last names of your friends, and you have created an AVL tree ? to store these last names. Note that there is a possibility that same last names exist in the list. In the case the same last name exists, the name is added to the left subtree.i. Design an algorithm for performing the operation ??????? to return all the entries in ? with keys equal to ?. ii. What is the run-time complexity, in Big-theta notation, of your algorithm?arrow_forward
- Suppose a new element 50 is to be inserted to the above tree. Answer the following questions: 1) What will be the parent node for new Node 50 ? 2) If adding the new Node 50 would make the AVL Tree balanced or unbalanced? Why ?arrow_forwardGiven the following binary tree in the picture (where nullptr height == -1):A. What is the height of the tree?B. What is the depth of node 90?C. What is the height of node 90?D. Give the pre-order, in-order, and post-order traversal of this treearrow_forward(1) what is the height of node "C" ? (2) what is the height of node "D" ? (3) what is the height of node "F" ? (4) what is the left-subtree-height of "C" (5) what is the right-subtree-height of "C" (6) what is the balance factor of "C' ? (7) what is the left-subtree-height of "D" (8) what is the right-subtree-height of "D" (9) what is the balance factor of "D" ? (10) what is the left-subtree-height of "F" (11) what is the right-subtree-height of "F" (12) what is the balance factor of "F" ? (13) Please write down the unbalance nodes if any. If every node is balanced, just enter "none". If more than one node is unbalanced, separate them by one comma. Ex: Y,X (14) There are four imbalance cases: LL, LR, RL, and RR. Please indicate the imbalance case of the previous unbalanced node . If every node balanced, just enter "none". If more than one node is unbalanced, just indicate the case for the first unbalanced node. (15) If an AVL tree has N elements, what could be the Big O notation of the…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education