answersLogoWhite

0

Can heap implement recursion

User Avatar

Anonymous

12y ago
Updated: 8/20/2019

Heap is a data-structure, it cannot implement anything. On the other hand, it is true that:

1. Recursive routines might use heap.

2. You can use dynamic memory allocation (heap), to implement a stack; and use the stack to implement recursion.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the C program for heap sort using recursion?

123


Can you implement merge sort without using recursion?

Sure, recursion can always be substituted with using a stack.


How can I implement an array-based heap in Java?

To implement an array-based heap in Java, you can create an array to store the heap elements and use methods to maintain the heap property. The root element is stored at index 0, and for any element at index i, its left child is at index 2i1 and its right child is at index 2i2. You can then implement methods like insert, delete, and heapify to maintain the heap structure.


Write a program of binary heap in c or c language?

to implement operations on binary heap in c


What is most appropriate data structure to implement priority queue?

heap


How can I implement an arrayheap in Java for efficient data storage and retrieval?

To implement an ArrayHeap in Java for efficient data storage and retrieval, you can create a class that represents the heap structure using an array. The array should be organized in a way that maintains the heap property, where the parent node is always greater (or smaller) than its children. You can then implement methods to insert elements into the heap and remove elements efficiently by adjusting the array structure to maintain the heap property. This will allow for quick access to the top element of the heap, making data storage and retrieval efficient.


Can you provide a solution to the diamond-square algorithm using Java and recursion?

Yes. It is possible to provide a solution to the diamond-square algorithm using Java and recursion.


Is there any way to perform quick sort other than stack?

Stack is not a way to perform quicksort, it is a tool used to implement recursion.


What is the difference between left recursion and right recursion in a grammar?

Recursion is what it's called when a function calls itself. When a function calls itself immediately before returning, it's called tail recursion. Tail recursion can be more efficiently written as iteration. In fact a good compiler will recognize tail recursion and compile it as iteration. There is no such thing as left or right recursion in C programming.


What is the use of recursion function?

Read the part in your programming manual/text book about recursion. The short answer while easy does not tell you anything about the power or dangers of recursion. It is the power and dangers of recursion that is important because once understood you can use recursion to good effect without running out of stack space.


How many types of recursion are there in c language?

Recursion in c language is a method where the function calls itself, within or outside the scope. Using Recursion, complicated problems can be divided into smaller parts so that solving them becomes more manageable. The recursion technique is available in Java, JavaScript, and C++.serves the same purpose. The type of Recursion in C • Direct Recursion • Indirect Recursion. Direct Recursion Recursion can call the function n-number of times. In the case of direct Recursion, the function calls itself inside the same position or in the local scope Direct Recursion problems are the Fibonacci series, a program to print 50 natural numbers. Indirect Recursion In the case of Indirect Recursion, a function X calls function Y, and function Y calls any function Z. Under certain conditions, function Z calls function A. In this case, function A is indirectly related to function Z. Indirect Recursion is also known as mutual Recursion, as more than one function runs a program. It is a two-step recursive function call process for making a recursive function call. Below mentioned are also type of Recursion: Tail Recursion No Tail/Head Recursion Linear Recursion Tree Recursion Tail Recursion A function is said to be tail recursion if it calls itself and also calls the last or the previous statement executed in the process. Head Recursion A function is said to be Head Recursion if it calls itself and also calls the first or the beginning statement executed in the process. Linear Recursion A function is said to be a linear recursive function if it makes a single call to itself each time the procedure executes itself and grows linearly depending on the size of the problem. Tree Recursion Tree Recursion is different from linear Recursion. Rather than making only one call to itself, that function makes more than one recursive call to the process within the recursive function. Following are the steps to solve the recursive problem in C: Step 1: Create a function and assign the work a part should do. Step 2: Select the subproblem and assume that the function already works on the problem. Step 3: Get the answer to the subproblem and use it to resolve the main issue. Step 4: The 90% of the problem defined is solved.


What is direct recursion?

When a function calls itself it is called as direct recursion. A function calls other functions which eventually call the original function is called as indirect recursion.