Write a function that findS the sum of value of the notes at Each lever(depth) in a giVen binary tRee and adD the resulT into a stack.This function will return the stack.You may uSe Height and push functions if needed. Please Use only 'C' language...

Write a function that findS the sum of value of the notes at Each lever(depth) in a giVen binary tRee and adD the resulT into a stack.This function will return the stack.You may uSe Height and push functions if needed. Please Use only 'C' language...

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

I'm trying to delete a node after inputting data for 2-3 checks but the node I try to delete remains in the list. How do I fix my deleteCheck() function to run correctly with the rest of my code? Thank you. #include <stdio.h>#include <stdlib.h>// Austin Chong// The core concept of this assignment is to use a linked list in a C program.// 07 March 2020 struct checkNode{int checkNumber;char date[8];char paidTo[100];char description[100];double amount;struct checkNode *head;struct checkNode *next;}; struct checkNode *checkBook = NULL; /* Functions */ void addCheck(){int checkNumber;double amount;char temp;struct checkNode *newCheck = (struct checkNode*) malloc(sizeof(struct checkNode));printf("Please enter the check number: ");scanf("%d", &checkNumber);newCheck -> checkNumber = checkNumber;printf("Please enter the amount: ");scanf("%lf", &amount);newCheck -> amount = amount;printf("Please enter the date: ");scanf("%c", &temp);scanf("%[^\n]", newCheck ->…
Write a menu-based program that implement simple binary Search Tree and write the following functions for that: 1.Write a function Add () that add a single leaf on each call according to BST. 2. Write function Delete () that delete the provided value on each call if exist.3.Write function In order () to display list of all nodes using in order traversing technique.4.Wire function Preorder () to display list of all nodes using preorder traversing technique.5.Wire function Post order () to display list of all nodes using post order traversing technique.
Suppose you have a list of key/value pairs (i.e., a nested list where each element of the list is a (key value)pair. For example, the list might look like this: '((France Paris) (France Nice) (Spain Madrid) (Poland Krakow) (Poland Warsaw)) (Notice that the keys need not be unique for this problem.) Write a function named first-occurrence in Scheme that takes a key and a list then returns the value of the first item on the list with a matching key. Return '() if none of items on the list has a matching key. You must use either fold or reduce to do the vast majority of the work. You may use the built-in foldmethod by adding the line (require 'list-lib), or you can use your own implementation. The built-in fold function has parameters in this order: action partial-result lst. You may assume that the list contains an element with the key to be updated. For example, (first-occurrence 'Germany '((France Paris) (Germany Bonn) (Germany Berlin))) should return 'Bonn (first-occurrence 'Poland…
Question 1 Full explain this question and text typing work only thanks
Find out how well the stack functions when it is allowed to be itself.
Please, Add a display function that prints the stack using FIFO(first in first out) {printed in the sequence they were entered} Do not use for loop. this is stack implementation. not your normal for loop. I can do it using for loop. so if you don't know, don't try. I will downvote for sure!! #include<stdio.h> #include<string.h>#include<stdlib.h>#define max 5int push(char stack[max][80], int *top, char data[80]){if(*top == max -1)return(-1);else{*top = *top + 1;strcpy(stack[*top], data);return(1);}}int pop(char stack[max][80], int *top, char data[80]){if(*top == -1)return(-1);else{strcpy(data, stack[*top]);*top = *top - 1;return(1);}}int main(){char stack[max][80], nm[80];int top,ch,reply;top = -1; // Initialize Stackprintf("\tMENU");printf("\n----------------------------\n");printf(" 1. PUSH\n");printf(" 2. POP\n");printf(" 3. EXIT\n");printf("----------------------------\n");while(1){printf("Choose operation : ");scanf("%d", &ch);switch (ch){case 1 : //…
Write a LISP function f10 that finds the intersection of two lists. The intersection meansthe common elements of the two lists. Example: (f10 ‘(a (a b) c d) ‘(b(a b) d)) returns ((a b) d) CAN ONLY USE CAR AND CDR AND RECURSION SETQ AND DO LIST CANT BE USED