Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8.4, Problem 3QE
Program Plan Intro
Tree:
A tree is a set of data entries having hierarchical organization similar to the organizational positions in any structured organization like schools, colleges, corporate offices.
Node:
The position at every hierarchical level of a tree is called a node. The node at the topmost position is called the root node.
Child pointer:
Child pointer stores the address of the child node
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Draw the diagrams of an 2-3 tree as the following items are inserted into an empty tree in the specified order: 8, 71, 90, 80, 84, 75, 76, 70, 10, 1, 2, 3, 4, 5, 6.
To simplify the diagrams, you only have to draw the diagrams before and after each split/promotion operation. If a split/promotion has to be done recursively, only draw the diagram after all recursive splits/promotions have been done.
Question 23
1. A complete traversal of an n-node binary tree is a(n).
for the recursive implementation.
1. 0(1)
2. O(log n)
3. O(n)
4. O(n2)
5. None of them
1
2
3
O
2 p
operation if visiting a node is O(1)
Question Three
A. Given the following Binary Search Tree (BST):
1. Write the pre-order of the nodes visited:
2. What is the height of the tree?
3. Remove the node E from the tree and re-draw the tree after removing the node
B. What would be returned (if n is 5) after executing the following recursive
int fun(int n)
1
if (n<2)
return 2:
else
return 4+funin-1),
C. Given a following graph: V= (a,b,c,d.f). E=((b.c).(c.b).(a.f).(d.a))
A. Draw the above graph.
B. Is the graph( Directed - undirected / Connected- disconnected / Complete)?
C. What is the size of the graph?
4/6
Chapter 8 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Ch. 8.1 - Give examples (outside of computer science) of...Ch. 8.1 - Prob. 2QECh. 8.1 - Prob. 3QECh. 8.1 - Prob. 4QECh. 8.1 - Prob. 5QECh. 8.2 - In what sense are data structures such as arrays,...Ch. 8.2 - Prob. 2QECh. 8.2 - Prob. 3QECh. 8.3 - Prob. 1QECh. 8.3 - Prob. 2QE
Ch. 8.3 - Prob. 3QECh. 8.3 - Prob. 4QECh. 8.3 - Modify the function in Figure 8.19 so that it...Ch. 8.3 - Prob. 7QECh. 8.3 - Prob. 8QECh. 8.3 - Draw a diagram representing how the tree below...Ch. 8.4 - Prob. 1QECh. 8.4 - Prob. 2QECh. 8.4 - Prob. 3QECh. 8.4 - Prob. 4QECh. 8.5 - Prob. 1QECh. 8.5 - Prob. 3QECh. 8.5 - Prob. 4QECh. 8.6 - In what ways are abstract data types and classes...Ch. 8.6 - What is the difference between a class and an...Ch. 8.6 - Prob. 3QECh. 8.7 - Suppose the Vole machine language (Appendix C) has...Ch. 8.7 - Prob. 2QECh. 8.7 - Using the extensions described at the end of this...Ch. 8.7 - In the chapter, we introduced a machine...Ch. 8 - Prob. 1CRPCh. 8 - Prob. 2CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 4CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 6CRPCh. 8 - Prob. 7CRPCh. 8 - Prob. 8CRPCh. 8 - Prob. 9CRPCh. 8 - Prob. 10CRPCh. 8 - Prob. 11CRPCh. 8 - Prob. 12CRPCh. 8 - Prob. 13CRPCh. 8 - Prob. 14CRPCh. 8 - Prob. 15CRPCh. 8 - Prob. 16CRPCh. 8 - Prob. 17CRPCh. 8 - Prob. 18CRPCh. 8 - Design a function to compare the contents of two...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 22CRPCh. 8 - Prob. 23CRPCh. 8 - Prob. 24CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 26CRPCh. 8 - Prob. 27CRPCh. 8 - Prob. 28CRPCh. 8 - Prob. 29CRPCh. 8 - Prob. 30CRPCh. 8 - Design a nonrecursive algorithm to replace the...Ch. 8 - Prob. 32CRPCh. 8 - Prob. 33CRPCh. 8 - Prob. 34CRPCh. 8 - Draw a diagram showing how the binary tree below...Ch. 8 - Prob. 36CRPCh. 8 - Prob. 37CRPCh. 8 - Prob. 38CRPCh. 8 - Prob. 39CRPCh. 8 - Prob. 40CRPCh. 8 - Modify the function in Figure 8.24 print the list...Ch. 8 - Prob. 42CRPCh. 8 - Prob. 43CRPCh. 8 - Prob. 44CRPCh. 8 - Prob. 45CRPCh. 8 - Prob. 46CRPCh. 8 - Using pseudocode similar to the Java class syntax...Ch. 8 - Prob. 48CRPCh. 8 - Identify the data structures and procedures that...Ch. 8 - Prob. 51CRPCh. 8 - In what way is a class more general than a...Ch. 8 - Prob. 53CRPCh. 8 - Prob. 54CRPCh. 8 - Prob. 55CRPCh. 8 - Prob. 1SICh. 8 - Prob. 2SICh. 8 - In many application programs, the size to which a...Ch. 8 - Prob. 4SICh. 8 - Prob. 5SICh. 8 - Prob. 6SICh. 8 - Prob. 7SICh. 8 - Prob. 8SI
Knowledge Booster
Similar questions
- Consider the “recursion tree” and “subproblem graph” for our two algorithms. The case n = 4 is illustrated below. For the case n = 4, the recursion tree has 16 vertices and 15 edges, while the subproblem graph has 5 vertices and 10 edges. For the case n = 10, determine the number of vertices and edges in the recursion tree, as well as the number of vertices and edges in the subproblem graph. Clearly justify your answers.arrow_forwardCreate a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: //PICTURE// You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.arrow_forwardillustrates a recursive pseudocode description of theinsert operation on a k-d tree. Here, x is the key to be inserted into the k-d tree, T isthe pointer to the k-d tree and DISC is the discriminator.arrow_forward
- Create a bottom-up insertion technique based on the same recursive approach, a red-black representation, and balanced 2-3-4 trees as the underlying data structure for an implementation of the fundamental symbol-table API. Only the sequence of 4-nodes (if any) at the bottom of the search path should be split by your insertion technique.arrow_forwardCreate a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic// You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree. Hints: Header file typedef char ElemType; typedef struct node//define the type of binary tree node { }BTnode; Source file #include <stdio.h> #include <stdlib.h> #include "tree.h" BTnode * createTree()//create the binary tree,return the root { BTnode *tnode;// tnode is the root char elem; ;//input the character //if the input is a space,set the pointer as NULL Else// if the input is not a space,generate the binary node and create its left…arrow_forwardCreate an implementation of a binary tree using the recursive approach introduced in the chapter. In this approach, each node is a binary tree. Thus a binary tree contains a reference to the element stored at its root as well as references to its left and right subtrees. You may also want to include a reference to its parent.arrow_forward
- Use the recursive strategy described in the chapter to implement a binary tree. Each node in this method is a binary tree. Thus, a binary tree includes references to its left and right subtrees in addition to the element stored at its root.You could also wish to make mention of its progenitor.arrow_forwardUse the recursive strategy described in the chapter to implement a binary tree. Each node in this method is a binary tree. Thus, a binary tree includes references to its left and right subtrees in addition to the element stored at its root. You could also wish to make mention of its progenitor.arrow_forwardConsider a tree that has a relatively high (between 10 to 30) typical number of children of each node. Under what conditions would a static child pointer array implementation be usable, and under what conditions would it be a better choice? Under what conditions would a dynamic child pointer array implementation be usable, and under what conditions would it be a better choice?arrow_forward
- binomial tree, Bn is defined recursively as follows. B0 is the tree with a single vertex.Create Bn+1, where n is a nonegative integer, by making two copies of Bn; the first copy becomes the root tree of Bn+1, and the second copy becomes the leftmost child of the root in the first copy.Here are examples for n = 0 to 3: Draw the binomial tree for n = 4 (it pays to do this neatly and carefully as it will makes the rest of the questions easier to answer). Create a table that has the depth of each of B0 to B4 (note that B0 has a depth of 1). Determine the formula for these as a function of n, and include in your table your calculation for B5 (you should NOT have to draw B5!). Create a table that has the number of nodes in each of B0 to B4. Determine the formula for these as a function of n, and include in your table your calculation for B5 (you should NOT have to draw B5!).arrow_forward4. Write a recursive algorithm in pseudocode that finds the lowest common ancestor (LCA) of two given nodes in a binary tree T. The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself). If either p or q is null, the LCA is null. For this problem, Nodes have left, right, and parent references as well as a field called level which stores the level of the node in the tree. In the sample tree below, node 5 is on level 0, while nodes 4 and 6 are on level 1. Write your solution here. 5 <- level 0 4 6 < level 1 function lowest_common_ancestor (Node P, Node q)arrow_forwardWrite programs to do BFS and DFS traverse of the graph, based on the adjacent list structure. By using queue, implement the BFS algorithm and print the node sequence. By using recursive method, implement the DFS algorithm and print the node sequence. The source node of the traverse should be input by the user.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