1.For a full binary tree, the number of leaf-nodes is more than non-leaf nodes. True False   2.For a Max-Heap, the functions Max and Extract-Max have same runtime complexity. True False 3.Heap-increase-Key and Heap-Decrease-Key both have same runtime complexity because both call Heapify function. True False   4.A sorted linked-list has fast insertion but slow extraction. True False   5.Don’t use Max-Heap in case you often perform search operation. Use sorted linked-list inserted. True False

Q: 22. Alternate Inorder traversal could be performed on a n-node BST by calling TreeMIN and then…

A: 22 d) log n times, this is equal to the height of the tree 23)  deque -> empty push - >4 push…

Q: True or false I) It is possible that a best case scenario in linear search can be a worst case…

A: Step 1  The correct answer is given in the below step

Q: What is a threaded binary tree traversal? a) a binary tree traversal using stacks b) a binary tree…

A: answer is

Q: Draw a single binary search tree that meets all the following conditions: • The tree contains 7…

A: Given tree is the single binary tree which contains 7 nodes from 1 to 7. It does not contain any…

Q: Given a binary search tree (BST), convert it into a min-heap where each node has a higher value than…

A: #include <iostream> #include <vector> #include <queue> #include <string>…

Q: Suppose that instead of each node x keeping the attribute x.p, pointing to x’s parent, it keeps…

A: Pseudocode is an artificial and informal language that helps programmers develop algorithms.

Q: What are the conditions for an optimal binary search tree and what is its advantage? a) The tree…

A: Question. What are the conditions for an optimal binary search tree and what is its advantage? a)…

Q: What are the disadvantages of normal binary tree traversals?

A: Correct answer is a

Q: What is the difference between the binary-tree search property versus the min heap property? Can a…

A: A binary search tree is a binary tree where each node has a Comparable key and satisfies the…

Q: Consider the below binary tree, construct the spanning tree using the recursive function call in DFS…

A: Consider  the below binary tree,construct the spanning tree using the recursive function call in DFS…

Q: (d) Given a non-empty binary tree T, let list L1 be the preorder traversal of T and list L2 be the…

A: len(L1) and len(L2) are the same because both list have same no. of nodes and value except their…

Q: (a) What is the Big-O (worst-case) time complexity of a Binary Search Tree? (b) Draw a normal (not…

A: Answer to the above questions is in step2.

Q: 2. Describe how the concept of a Binary Search Tree (BST) is an example of both a greedy algorithm…

A: Greedy Binary Search Tree  are not destined to be ideal, yet they are destined to be almost ideal.…

Q: (e) Let X be a node in a binary search tree and let node Y be the predecessor of X. Which of the…

A: If X has two children  its predecessor is the maximum value in its left subtree and its successor…

Q: Assuming the binary search tree(BST) shown below, what is th order of the nodes visited by Inorder…

A: In Inorder Traversal, the parent node is traversed between left and right subtrees

Q: erase any node from the heap - be it the root or any sub-tree node. The challenge is to rebuild the…

A: Heap Data Structure A Heap is a  Special tree type Data Structure In heap it is a tree is a…

Q: 3) 4) Suppose that we are working with linked lists that are circular, singly-linked, and have no…

A: Answer: 3)x.next = L 4)T

Q: For the given complete binary tree (given in an array): 1 2 3 4 5 6 7 8 9 10 11 J B K A O T U X R Q…

A:

Q: Consider a binary search tree (BST) whose elements are the integer values: Starting with an empty…

A: A binary search tree (BST) is a data structure in which the values which are less than root node…

Q: Write a C++ function int deleteMax() that deletes the maximum value from the max heap (obviously the…

A: int deleteMax(int arr[], int& n){//It is uses to Get the last elementint lastElement = arr[n -…

Q: What are double and single threaded trees?

A: Single Threaded Binary Tree:In this each node is threaded towards either the in order predecessor or…

Q: Suppose tree Tis a min heap of height 3. - What is the largest number of nodes that T can have?…

A: i)-Largest number of nodes that T can have 2^(h+1) -1 nodes. i.e, it has 15 nodes. ii)-Smallest…

Q: Consider the following binary search tree where nodes are labeled by alphabets. Here the keys are…

A: Here in this question we have given a binary search tree and we have asked to find min key,max key,…

Q: What is the difference between a min heap search and a binary tree search? Is it feasible to…

A: Encryption: A binary search tree is a binary tree in which each node has a Comparable key that is…

Q: What is/are the advantage(s) of linked lists over arrays? From where do you access to the nodes in a…

A: You have mentioned : Consider the following binary search tree T given below but its not given here…

Q: For every node p in a binary search tree, with a key-value pair of (k, v), all of the following are…

A: The correct answer of the given question is" Key stored in right subtree are greater than k"

Q: mplete. Circle your answer and provide explanation why. Also, which of the trees can be considered a…

A: Here in this question we have given two tree and based on the property we have asked that weather…

Q: Suppose the numbers 15, 40, 8, 17, 4, 16, 9, 18, 50, 20 are inserted in that order into an initially…

A:

Q: a) Which array out of A, B and C represents a binary heap? Only one answer is right. A- 1 12 23 10…

A:

Q: mplement the Binomial Tree Using Java-Generic-Programing, which provide the following menu 1. Insert…

A: the code is an given below :

Q: Given that we discovered a circular array implementation for queues to be favorable, does this…

A: Please find the detailed answer in the following steps.

Q: c) Given a heap containing 55 nodes, how many nodes are internalinon-leaf nodes?

A:

Q: Suppose we have an IntTree ADT as follows: elass IntTree ( public: int keys IntTree left, right/…

A: MinHeap - The min heap is having the root node value less or equal to the value of its child nodes.

Q: Below is given a header file and a source file of a Binary Search Tree. Inputs are 6 , 4, 2 , 5, 1,…

A: According to the information given:- We have to Simulate the recursion for in-order and post order…

Q: What is the runtime (using big-O notation) of a search operation in a balanced binary search tree…

A: First lets understand what balanced binary search tree mean: in balanced binary search tree, at…

Q: Starting with an empty BST, show the effect of successively adding the following elements: cow, fox,…

A: Initial node is considered as root Then, the node that is lesser will be added at left side and the…

Q: sing any type of BST, critically explain the self-balancing principle of the binary search trees

A: Binary search tree is  a tree which has atmost 2 children and value of lef sub tree is always less…

Q: 1ist is best to answer questions such as "What is the item at position n?" À. Lists implemented with…

A: The answer for the given question is as follows.

Q: Fun problem. Given a linked list, check in O(n) if it is a palin- drome. For example, [1 →2 →3 →2]…

A: A palindrome is a word, number, phrase, or other sequence of characters which reads the same…

Q: Suppose we have an IntTree ADT as follows: class IntTree { public: int key: IntTree *left, *right;…

A: Heap: A Min-Heap could be a complete binary tree within which the worth in every internal node is…

Q: What are double and single threaded trees? a) when both left, right nodes are having null pointers…

A: Answer: a Explanation: They are properties of double and single threaded binary trees respectively.

Q: You are given a list of numbers for which you need to construct a min-heap. (A min-heap is a…

A: Min-heap Property: The value at each node is less than or equal to the value of its clild…

Q: Q1) Implement a double linked-list to store cars data. Write a double linked-list class including…

A: We will implementing the above mentioned questions in the below mentioned java classes. Cars.java…

Q: Given a heap with more than ten nodes, which of the following statements is wrong? O a. None of the…

A:

Q: Given a typical Queue q with elements [E,D (where Front/left of Queue at E and Rear/right of Queue…

A:

Q: A priority queue is implemented as a linked list, sorted from largest to smallest element. a. How…

A: Actually, A priority queue is different from a "normal" queue, because instead of being a…

Q: If one were to implement a list ADT using a balanced binary search tree, how would the worst-case…

A: Trees are useful for implementing a variety of abstract data types.We say that a family of binary…

Q: C++ DATA STRCUTURES AND ALGORITHMS Build a heap tree from the given information or values.  50 45 65…

A: Rule:- parent node must be greater than child node.  Start picking one by one element. Check if…

Heap Sort

A Heap is a type of data structure that is built on trees. It's a binary tree that's virtually complete. Except for the very bottom level, all levels of the tree must be filled in a heap. The last (bottom) level should be filled from left to right. The heap data structure is used for the efficient implementation of priority queues.Heap can be of two types: