Write a recursive function "int CountLeaf(BITree t)" which count the number of leaf nodes in the binary tree. (Hint: binary tree is defined as follow) struct BiTreeNode ElementType Element; struct BiTreeNode "Left; struct BiTreeNode "Right; typedef struct BiTreeNode "Position , "BITree;

Write a recursive function "int CountLeaf(BITree t)" which count the number of leaf nodes in the binary tree. (Hint: binary tree is defined as follow) struct BiTreeNode ElementType Element; struct BiTreeNode "Left; struct BiTreeNode "Right; typedef struct BiTreeNode "Position , "BITree;

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

Write a recursive function called "GetParent" in Binary Search Tree of the given node. You can take as many arugments as you like. Use the following structure defination. struct TNode{ char NodeName[10]; TNode *LeftT, *RightT; } root; use c++
C++ code Write a program to perform following tasks: Given a binary tree of integers, the task is to write in-order tree traversal method that display node’s data if it is even positive number. In all other cases it should display -1. A.Given an array and an integer N, find elements which are divisible by N, using STL Algorithms in C++. B.Given a vector, reverse this vector using STL in C++ without using predefined functions/algorithms. C;Given an integer array containing repeating elements, find number of occurrences of each element using STL map (without using any predefined method) in C++. MUST BE ALL (A.B.C) IN ONE PROGRAM
Language: JAVA Script Write a recursive function called 'shortestToLongest' which takes an array of lowercase strings and returns them sorted from shortest to longest. Strings of equal length should be sorted alphabetically. (Hint: stri <str2 will return true if str1 comes before str2 alphabetically) Your function should accept a default argument called 'sorted' which holds the currently sorted elements. Each recursive step should add the shortest string in the strings array to the end of 'sorted'. // Examples: // Sorts strings from shortest to longestlet strings1 = ["abc", "de", " ", "f", "ghijk", "Imno"] shortestToLongest (strings1);// [' ', 'f', 'de', 'abc', 'lmno', 'ghijk'] // Accepts a pre-sorted default parameter let strings2 = ["pomegranate", "persimmon", "peach"]; let sorted ["pea", "pear"];shortestToLongest (strings2, sorted); // ['pea", "pear', 'peach', 'persimmon', 'pomegranate'] // Sorts strings of the same length alphabetically let strings3 = ["dog", "cat",…
Java Programming Exercise 2 Another co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function: public boolean searchRecursive(Node current, int searchValue) { if (current.data == searchValue) return true; else if (current == null) return false; else if (current.data > searchValue) return searchRecursive(current.left, searchValue); else return searchRecursive(current.right, searchValue); } She says that she “keeps getting an error” but unfortunately did not say if it was a compile error or a run-time error (or both). You analyze the code and see there is indeed an error and so you reply with the following: 1. Draw a picture of what a binary search tree would look like after inserting values of 5, 10, 8, 15, 4, 2, and 3 in that order 2. Next, tell her why she gets either a compile time error or run-time error (or both)…
Recursive Count Write a recursive function rc_count(L:List[int], x:int) -> int that takes a list L and an integer x. The function returns the number of occurrences of x in L. For example, rc_count([1,1,2,3], 1) returns 2 and rc_count([1,1,2,3], 4) returns 0. Your Answer: 1 # Put your answer here 2 Submit
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
Exercice 2 a-In SLL class, write a recursive function called public int CountOdds (SLL Ist) which counts the number of nodes containing ODD values in a SLL b-Then, in a void main method, create the following SLL. Also print the count of odd values. first last 100 300 +
A BST is constructed in the usual way using the node definition below. Write a function int child2( bst node t *curr) that returns the number of nodes that have 2 children. typedef struct BST NODE T {int data;struct BST NODE T *left, *right; } bst node t; int child2( bst node t *curr){ }
In C++ Plz LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts ItemNode.h Default Code: #include <iostream>#include <string>using namespace std; class ItemNode {private: string item; ItemNode* nextNodeRef; public: // Constructor ItemNode() { item = ""; nextNodeRef = NULL; } // Constructor ItemNode(string itemInit) { this->item = itemInit; this->nextNodeRef = NULL; } // ConstructorItemNode(string itemInit, ItemNode *nextLoc) {this->item = itemInit;this->nextNodeRef = nextLoc;} // Insert node after this…
Modify the given code to accept float instead of int as a coefficient in C LANGUAGE: // Node structure containing power and coefficient of// variablestruct Node {int coeff;int pow;struct Node* next;}; // Function to create new nodevoid create_node(int x, int y, struct Node** temp){struct Node *r, *z;z = *temp;if (z == NULL) {r = (struct Node*)malloc(sizeof(struct Node));r->coeff = x;r->pow = y;*temp = r;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}else {r->coeff = x;r->pow = y;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}} // Function Adding two polynomial numbersvoid polyadd(struct Node* poly1, struct Node* poly2,struct Node* poly){while (poly1->next && poly2->next) {// If power of 1st polynomial is greater then 2nd,// then store 1st as it is and move its pointerif (poly1->pow > poly2->pow) {poly->pow = poly1->pow;poly->coeff = poly1->coeff;poly1 =…
h BinarySearchTree.java, write code for the following new functions: 1. public int height( BinaryNode t ) This function takes as input the root of a BST and returns its height. 2. public boolean isFull ( BinaryNode t ) This function takes as input the root of a BST and returns true if it is full or false if it is not. 3. public Boolean isAVLTree ( BinaryNode t ) This function takes as input the root of a BST, and returns true if the BST is an AVL tree, i.e. is balanced, or returns false if not. Run the BinarySearchTreeTester.java file once your code is complete to test that your code works.
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) node* left(node* p) { return p->left; } node* right(node* p) { return p->right; } node* sibling(node* p){ if(p != root){ node* P = p->parent; if(left(P) != NULL && right(P) != NULL){ if(left(P) == p){ return right(P); } return left(P); } } return NULL; } node* addRoot(int e) { if(size != 0){ cout<<"Error"<<endl; return NULL; } root = create_node(e,NULL); size++; return root; } node* addLeft(node* p, int e) { if(p->left == NULL){ node* newLeft =…