1BN 141516AQ.No.4.2Consider the following alphabet with equivalent code number.Q4E171819TRa) Design a binary search tree of your FullName(USAMA ZAFAR) by taking its equivalentdigit and provide a post order traversal of it. Thecode for blank space is 0.67HF20218U22VWJ1011K2324YXb) Write algorithms for the following functions (inbinary search tree)12M132526I. that counts the number of nodes in a binary search treeП.that sums up all the keys in a binary search tree

given name: USAMA ZAFAR required to create binary search tree for this. the answer is given in the…

15 16 17 R Q.No.4. C 3. Consider the following alphabet with equivalent code number. 4 18 E 6. a) Design a binary search tree of your Full Name(USAMA ZAFAR) by taking its equivalent digit and provide a post order traversal of it. The code for blank space is 0. F 7 8. 19 20 21 V 22 23 9. 10 J K 11 12 M 24 25 26 b) Write algorithms for the following functions (in binary search tree) 13 I. that counts the number of nodes in a binary search tree П. that sums up all the keys in a binary search tree zlola lo lo SEP> x>N

15 16 17 R Q.No.4. C 3. Consider the following alphabet with equivalent code number. 4 18 E 6. a) Design a binary search tree of your Full Name(USAMA ZAFAR) by taking its equivalent digit and provide a post order traversal of it. The code for blank space is 0. F 7 8. 19 20 21 V 22 23 9. 10 J K 11 12 M 24 25 26 b) Write algorithms for the following functions (in binary search tree) 13 I. that counts the number of nodes in a binary search tree П. that sums up all the keys in a binary search tree zlola lo lo SEP> x>N

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

Question # 01: Consider the searching problem: Input: A sequence of n numbers A = (a1, a2, a3, an ) a value V. Output: An index i such that v = A[i] or the special value NIL if v does not appear in A. Write pseudocode for linear search, which scans through the sequence, looking for v. Using a loop invariant, prove that your algorithm is correct. Make sure that your loop invariant fulfills the three necessary properties.
Python Using recursion only No loops Using such type()function, len()function, indexing, slicing The function must return true(boolean) if a list has sets otherwise returns false def hasSet(lst):
Write an algorithm for the following (algorithm not pseudocode, not implementation of codes) a. algorithm to delete all nodes having greater than a given value, from a given singly linked list b. algorithm to delete a node from a doubly linked list c. algorithm to add two polynomials using linked list
Using an in-order traversal it is quite easy to output all the data in a binary search tree in order. Design an algorithm which when given a binary search tree and two numbers x and y outputs all the data items z in order with the property that x
b. Given a BST whose root node is represented by the node root. Write a function findroots(Node * root) to traverse the BST and print the number of total parent (atleast have a child node) nodes of the BST. N.B: Print order doesn't matter Fig 1: An example Binary Search Tree. 5 For example: In this figure, there are total 4 parents
1 Write a Racket function (is-sorted x) where x is a list of numbers. Function returns true (#t) if numbers are in ascending order, false (#f) if not. Examples > (is-sorted (1 2 34 5)) #t > (is-sorted (2 1 2 3 4)) #f Algorithm If x is one element return #t Else Evaluate 1" element of x < 2n° element of x Evaluate function recursively with argument (cdr x) Value is the AND of the two expressions
Consider the following binary search tree (BST): List down the sequence of elements encountered when the BST is traversed using pre-order and in-order.
QUESTION 3 W K. R N. Given the tree above, show the order of the nodes visited using recursive in-order traversal. Chck Save amd Submit to save and submit. Chck Save AlL Answers to save all ansuers. a
A. B. 3 In the search tree below, the two-line codes indicate the target, and the numbers on the edge indicate the cost of the search. Using each of the following blind methods, write the order of the nodes to be searched to reach the first target: a) Breath-first Search (BFS) b) Depth-first Search (DFS) c) Iterative Depth-first Search