Ouch! A kitten got stuck on a tree. Fortunately, the tree's branches are numbered. Given a description of a tree and the position of the kitten, can you write a program to help the kitten down? Input Kitten on a Tree 14 25 24 4312 13 9 4 11 10 20 8 7 32 10 21 23 13 19 32 22 19 12 5 14 17 30 14 6 15 16 30 18 31 29 24 23 26 26 27 28 -1 20 The input is a description of a single tree. The first line contains an integer K , denoting the branch on which the kitten got stuck. The next lines each contain two or more integers a, b₁,b2,.... Each such line denotes a branching: the kitten can reach a from b₁,b2,... on its way down. Thus, a will be closer to the root than any of the bi. The description ends with a line containing -1. Each branch b; will appear on exactly one line. All branch numbers are in the range 1..100, though not necessarily contiguous. You are guaranteed that there is a path from every listed branch to the root. The kitten will sit on a branch that has a number that is different than the root. The illustration above corresponds to the sample input. Output Output the path to the ground, starting with the branch on which the kitten sits. Sample Input 1 Sample Output 1 23 14 19 23 24 25 19

Ouch! A kitten got stuck on a tree. Fortunately, the tree's branches are numbered. Given a description of a tree and the position of the kitten, can you write a program to help the kitten down? Input Kitten on a Tree 14 25 24 4312 13 9 4 11 10 20 8 7 32 10 21 23 13 19 32 22 19 12 5 14 17 30 14 6 15 16 30 18 31 29 24 23 26 26 27 28 -1 20 The input is a description of a single tree. The first line contains an integer K , denoting the branch on which the kitten got stuck. The next lines each contain two or more integers a, b₁,b2,.... Each such line denotes a branching: the kitten can reach a from b₁,b2,... on its way down. Thus, a will be closer to the root than any of the bi. The description ends with a line containing -1. Each branch b; will appear on exactly one line. All branch numbers are in the range 1..100, though not necessarily contiguous. You are guaranteed that there is a path from every listed branch to the root. The kitten will sit on a branch that has a number that is different than the root. The illustration above corresponds to the sample input. Output Output the path to the ground, starting with the branch on which the kitten sits. Sample Input 1 Sample Output 1 23 14 19 23 24 25 19

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

using java code Problem: Suppose we want to write a program for the class BinaryTree that counts the number of times an object occurs in the tree. We need to use a method with the following header, public int count (O anObject) 1. Name your class objectCounter 2. Define main method, test the program 3. Write a method using one of the iterators of the binary tree. 4. Write another method using a private recursive method of the same name NB: Can you add main method to test the code please for 2. Define main method, test the program
In Python 3 You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does have to be similar. Thank You.
In Python 3 You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does not have to be the same. (Check picture) import turtle def tree(t, trunkLength):if trunkLength < 5: #check for base casereturnelse:t.forward(trunkLength)t.right(30)tree(t, trunkLength - 15)t.left(60)tree(t, trunkLength - 15)t.right(30)t.backward(trunkLength) import turtlet =…
Use the programming language python to solve the following task You and your neighbor both have equally sized gardens. The gardens are represented as 2D lists, where the garden [i] [j], gives an element to the position (i, j). Each element of a garden is represented as a string, and can be any of the following: "grass", "moss", "strawberry", "rock", "raspberry". You have recently seen that there has been a lot of moss and stone in your garden, and suspect that it is your neighbor who has put it there. To fix this, complete the clean_garden (my_garden, neighbors_garden) function. Here you will first create small functions to make it easier to solve the actual task. Create a function find_item that takes in two arguments: (garden, item), which returns an (i, j) position as a tuple, whose item is in the garden. If it does not exist, return None Create a function swap_items that exchanges two elements between two gardens, let it take in these arguments: (garden1, garden2, pos1, pos2),…
Given a singly linked list, reverse the list. This means you have to reverse every node. For example if there are 4 nodes, the node at position 0 will move to position 3, the node at 1 will move to position 2 and so on. You do not have to write the Node class just write what you have been asked to. You are NOT allowed to create a new list. In python language
A binary tree is balanced if every node in the tree is such that the heights of its left and right subtrees do not differ by more than one. Complete the pseudo-code method isBalanced which determines if a binary tree is balanced. The function returns a value of -1 if the tree is not balanced, otherwise it returns the height of the tree. Add comments to explain what your code segment is doing. The following definition of a node in the tree is used. class BinaryNode { int element; BinaryNode left; BinaryNode right; } Complete the method below: int isBalanced (BinaryNode t) { int leftCount=0; int rightCount=0; if (t == null) //empty tree, height is 0 return 0; if ((t.left== null) and (t.right== null) return 0; else { . . . . . . . . . } }
IN JAVA Alice and Bob are playing a board game with a deck of nine cards. For each digit between 1 to 9, there is one card with that digit on it. Alice and Bob each draw two cards after shuffling the cards, and see the digits on their own cards without revealing the digits to each other. Then Alice gives her two cards to Bob. Bob sees the digits on Alice’s cards and lays all the four cards on the table in increasing order by the digits. Cards are laid facing down. Bob tells Alice the positions of her two cards. The goal of Alice is to guess the digits on Bob’s two cards. Can Alice uniquely determine these two digits and guess them correctly? Input The input has two integers p,q (1≤p<q≤9) on the first line, giving the digits on Alice’s cards. The next line has a string containing two ‘A’s and two ‘B’s, giving the positions of Alice’s and Bob’s cards on the table. It is guaranteed that Bob correctly sorts the cards and gives the correct positions of Alice’s cards. Output If Alice can…
It is known that a matrix can be understood (in python) by a list of lists. In this context, make a program that receives 9 numbers, organize them in a matrix 3 x 3 and print this matrix and its transpose. In Phyton3
Computer Science Given two polynomials in form of strings. How to use Java program that adding, subtracting, and multiplying two polynomials using singly linked lists. Using a singly linked list to represent a polynomial. Each term will be saved in a node in the list. The length of the list will be the number of terms in the given polynomial. Input: The input will be two polynomials in the following form of strings, for example: "(-4.5)X^1 + (-2.5)X^0 + 1X^3" "1X^2 + 1X^0" Output: Polynomial p: X^3 -4.5X -2.5 Polynomial q: X^2 + 1.0 p+q: X^3 + X^2 -4.5X -1.5 p-q: X^3 -X^2 -4.5X -3.5 p*q: X^5 -3.5X^3 -2.5X^2 -4.5X -2.5 import java.util.StringTokenizer; public class Term { private double coeff; private int pow; } import java.util.StringTokenizer; public class Polynomial { private SinglyLinkedList<Term> p; public Polynomial(String st) { } public Polynomial add(Polynomial q) { } public Polynomial subtract(Polynomial q) { } public Polynomial multiply(Polynomial q) { } public…
Computer Science This is a codingbat problem. Please answer in Java and do not change the starter code. You have been asked to write the game of tic tac toe. In the first version of the game, we will only be comparing horizontally for a win. A win is determine by all of the elements in a row either being an X or an O. You need to return a String with the winner or TIE if there is no winner. ticTacToe(["X", "O", "O"], ["X", "O", "O"], ["X", "X", "X"]) → "X"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "O", "O"]) → "O"ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "X", "O"]) → "TIE" public String ticTacToe(String[] top, String[] middle, String[] bottom) { }
The word ladder game was invented by Lewis Carroll in 1877. The idea is to begin with a start word and then change one letter at a time until you arrive at an end word. Each word along the way must be an English word. For example, starting from FISH, you can arrive at MAST through the following word ladder:FISH, WISH, WASH, MASH, MAST Write a program that uses recursion to find the word ladder given a start word and an end word, or that determines no word ladder exists. Use the file words.txt that is available online with the source code for the book as your dictionary of valid words. This file contains 87,314 words. Your program does not need to find the shortest word ladder between words; any word ladder will do if one exists. list aalii aardvark aardvarks aardwolf aba abaca abaci abacist aback abacus abacuses abaft abalone abalones abamp abampere abandon abandoned abandonee abandoner abandoners
Write a program that lists all Fibonacci numbers that are less than or equal to the number k (k≥2) entered by the user. Definition:The Fibonacci sequence is a sequence of numbers in which each additional term is the sum of the previous two. It is based on the fact that each member of the sequence is formed by the sum of the previous two members, the sequence starting with the numbers 1 and 1. (Example 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 , 377, 610, 987 write program in c language