C How to Program (8th Edition)
8th Edition
ISBN: 9780133976892
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 12, Problem 12.17E
Program Plan Intro
Program plan:
- line, token variables are used for input. There is structure Treenode having data, leftptr, rightptr member variables which represent the tree node.
- void insertnode(node **ptr, char *value) function inserts the node in the tree.
- void preorder(node *ptr) function displays the contents of the tree in a preorder fashion.
- void inorder(node *ptr) function displays the contents of the tree in an in-order fashion.
- void postorder(node *ptr) function display the contents of the tree in a post-order fashion.
Program description:
The main purpose of the program is to create a tree from the line entered by the user and split it into the word. Then these words are inserted into the tree. This created tree contents are displayed in preorder, inorder and postorder fashion.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
- Give Java Code that finds the number of children using the sequential representation, Linked Implementations Using Array of Child Pointers implementation, linked implementation left-child/right-sibling.
Please code the following and pleace us Stack<T>
Identify the difference between STACK and ARRAY.
Chapter 12 Solutions
C How to Program (8th Edition)
Ch. 12 - Prob. 12.6ECh. 12 - (Merging Ordered Lists) Write a program that...Ch. 12 - Prob. 12.8ECh. 12 - (Creating a Linked List, Then Reversing Its...Ch. 12 - Prob. 12.10ECh. 12 - Prob. 12.11ECh. 12 - Prob. 12.12ECh. 12 - Prob. 12.13ECh. 12 - Prob. 12.14ECh. 12 - (Supermarket Simulation) Write a program that...
Knowledge Booster
Similar questions
- C++, Write a recursion function that counts the positive elements multiple of 5 in a binary search tree and counts the elements less than 0 and multiple of 2, then returns the two counts multiplied to the main.Note that you have to write only one function and you can add parameters to the function as neededarrow_forwardPython program- implement a singly linked list with following functions: - add_head(e) - add_tail(e) - find_3rd_to_last() - returns element located at third-to-last in the list - reverse() - reveres the linked list, note, this is not just printing elements in reverse order, this is actually reversing the listarrow_forward- Write a Java code that finds if two given nodes in a general tree are siblings or not for the list of children implementation, linked implementation left-child/right-sibling. - Write a Java code that remove next sibling in a general tree for the linked implementation using array of child pointers, array implementation left-child/right-sibling.arrow_forward
- Complete using Standard C programming. Implement a singly linked list that performs the following: Displays the maximum value in the linked list using recursion. Displays the linked list in reverse order using recursion. Merge two single linked lists and display.arrow_forwardWrite code for following--arrow_forwardAnswer (iii) with detailed and concise explanations. Give the content of the stack after each of the following operations takes place.arrow_forward
- C++ Recall that a "leaf" node in a binary tree is one which has no child nodes, and the height of a tree is the maximum number of edges from its root to one of its leaves). We also saw how easily a binary tree can become poorly structured, where the heights to various leaves in the tree vary dramatically. A full binary tree is one where each node other than the leaf nodes has two child nodes, Write a recursive function which returns true if a binary tree is full, false otherwise. Please avoid the use of variables declared outside of the function.arrow_forwardCount word dominators def count_word_dominators(words): If you already solved the earlier count_dominators problem, you might notice that even though the problem was originally stated for lists of integers, the logic of domination did not depend on this fact in any way. As long as the individual elements can be compared with each other for order, the Pythonic spirit of duck typing allows the very same count_dominators function to handle a list of strings just as smoothly as it would handle a list of integers! For example, the function call count_dominators(['dog','emu','cat','bee']) would return 3, since 'emu', 'cat'and 'bee' dominate all words coming after them in the list when using the lexicographic order comparison. If your count_dominators function does not already pass this hurdle, try to rewrite it to contain no baked-in assumptions about elements being specifically integers. However, things become more interesting if we define domination between words of equal length with a…arrow_forward1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).arrow_forward
- (True/False): Arrays are passed by reference to avoid copying them onto the stackarrow_forwardOne-friend recursion vs iteration.1. Your task is to accept a tuple a1, a2, ... , an and return the reversed tuple an, an−1, ... , a1. Being lazy, you will only strip off an element from one end or add an element back onto one end. But you have recursive friends to help you. Provide both a paragraph containing the friend’s explanation of the algorithm, and the recursive code.2. Now suppose that you have a stack, but no friends. (See Chapter 3). Quickly sketch an iterative program that solves this same problem. Be sure to include loop invariants and other the key steps required for describing an iterative algorithm.3. Trace each of these two programs. Step by step, compare and contrast their computations on a computer. i already uploaded this question 3 times and getting wrong answer so if you don't know right answer dont write rubbih ans otherwise you will get downvotearrow_forwardOne-friend recursion vs iteration.1. Your task is to accept a tuple a1, a2, ... , an and return the reversed tuple an, an−1, ... , a1. Being lazy, you will only strip off an element from one end or add an element back onto one end. But you have recursive friends to help you. Provide both a paragraph containing the friend’s explanation of the algorithm, and the recursive code.2. Now suppose that you have a stack, but no friends. (See Chapter 3). Quickly sketch an iterative program that solves this same problem. Be sure to include loop invariants and other the key steps required for describing an iterative algorithm.3. Trace each of these two programs. Step by step, compare and contrast their computations on a computer. i already uploaded this question 3 times and getting wrong answer so if you don't know right answer dont write rubbih ans otherwise you will get downvote don't copy bartleby old or chegg its wrongarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning