A binary heap is a complete binary tree which satisfies the heap ordering property. The diagram below illustrates how we would think of the binary min-heap (like a tree). Additionally, the diagram shows the actual Python list which stores the values. 19 22 5 The root is stored at index 1 For a node at index position p: left child at index 2p right child at index 2p+1 7 6 13 8 22 8 19 4 Define a function called get_sibling (a_list, index) which takes a binary min-heap represented by a Python list and an integer as parameters. The function should return the value of the sibling of the element specified by the parameter index. The function should return None if the index is not in the valid range. Note: you can assume that the parameter list is not empty. For example: Test Result print(get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 1)) None print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 4)) 8 print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 8)) None print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 9)) None

A binary heap is a complete binary tree which satisfies the heap ordering property. The diagram below illustrates how we would think of the binary min-heap (like a tree). Additionally, the diagram shows the actual Python list which stores the values. 19 22 5 The root is stored at index 1 For a node at index position p: left child at index 2p right child at index 2p+1 7 6 13 8 22 8 19 4 Define a function called get_sibling (a_list, index) which takes a binary min-heap represented by a Python list and an integer as parameters. The function should return the value of the sibling of the element specified by the parameter index. The function should return None if the index is not in the valid range. Note: you can assume that the parameter list is not empty. For example: Test Result print(get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 1)) None print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 4)) 8 print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 8)) None print (get_sibling ( [0, 5, 7, 6, 13, 8, 22, 8, 19], 9)) None

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

The Priority. Queue ADT As an ADT, a priority queue P supports the following functions: • isPQueueEmpty(): returns true if pqueue is empty otherwise false size(): Return the number of elements in P. empty(): Return true if P is empty and false otherwise. Example: The following table shows a series of operations and their effects on an initially empty priority queue P. Each element consists of an integer. which we assume to be sorted according to the natural ordering of the integers. Note that insert(e): Insert a new element e into P. min(): Return a reference to an element of P with the smallest associated kex value (but do not remove it); an error condition occurs if the priority queue is empty. removeMin): Remove from P the element referenced by min(); an error condition occurs if the priority queue is empty. each call to min returns a reference to an entry in the queue, not the actual value. Although the "Priority Queue" column shows the items in sorted order, the priority queue…
*Please using JAVA only* Objective Program 3: Binary Search Tree Program The primary objective of this program is to learn to implement binary search trees and to combine their functionalities with linked lists. Program Description In a multiplayer game, players' avatars are placed in a large game scene, and each avatar has its information in the game. Write a program to manage players' information in a multiplayer game using a Binary Search (BS) tree for a multiplayer game. A node in the BS tree represents each player. Each player should have an ID number, avatar name, and stamina level. The players will be arranged in the BS tree based on their ID numbers. If there is only one player in the game scene, it is represented by one node (root) in the tree. Once another player enters the game scene, a new node will be created and inserted in the BS tree based on the player ID number. Players during the gameplay will receive hits that reduce their stamina. If the players lose…
python Define a function sorted_intersection which • accepts two sequences, and • return a list whose elements are in ascending order and from the intersection of the given lists. For example: Test assert sorted_intersection ([1,2,3], [2,3,4]) [2,3] assert sorted_intersection ([1,3,5,7,9], [1,9,5]) == [1,5,9] Result
Q1 \ Convert the following infix expression into postfix one: (A+B^D)/(D-F)+G PS: you have to illustrate the different steps of this conversion one by one.
Question 1 Full explain this question and text typing work only thanks
Implement the following search strategies using C programming. You may use tree, queue and stack structures in your implementation. a) BFS b) UCS c) DFS Use the following map as sample and place it in your tree: B 3 3 A D 2 12
C++ Consider the following function as a property of a LinkedBag that contains a Doubly Linked List. Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods. Assume that the doubly linked list is: 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6 If you are uncertain what the above diagram depicts, it is a doubly linked list such that: The head of this doubly linked list is the node that contains the value 1. The tail of this doubly linked list is the node that contains the value 6. The 3rd node in this list contains the value 3. The contents of this list are the values 1 through 6 in sequential order. The following questions are regarding the linked list after after the test_function is run. A. The head of the list after the test_function is run contains the value: B. The tail of the list after the test_function is run contains the value: C. The 3rd node in the list after the test_function is run…
10
in C++
Computer Science Java Programming ******* Write a Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency. Must use Stack, either Double ArrayList or Linked List, and simple search to implement this. Module A: Dependencies: B D E K L Module B: Dependencies: F G M Module C: Dependencies: F Module D: Dependencies: G Module E: Dependencies: B A Module F: Dependencies: B Module G: Dependencies: NONE Module K: Dependencies: M Module L: Dependencies: Q Module M: Dependencies: A Module Q: Dependencies: NONE Ensure that dependencies are only visited only once. To test: Input A Your Output: Module A. Dependencies: B F G M D E K M L Q
Write a program in C++ to create a Binary Search tree (BST) of integers. The program will perform these operations: Insert node(s), Traverse In-order, Search node, Delete node, Leaf Count, Parent of a node and Quit. Use the header file similar to this: #include #ifndef BT_H #define BT_H using namespace std; class BT { private: struct node { int data; node* left; node* right; }; node* root; public: BT(); bool isEmpty() const { return root == NULL; } void insert(int); void print_inorder(); void inorderTrav(node*); void searchBST (int); void deleteNode(int); int count (); int leafCount(node*); void nodeParent(int); //Constructor //Check for empty //Insert item in BST //In-order traversing driver //In-order traversing //Searches BST for a specific node //Delete item from BST //Count driver //Counts number of leaves in BST //Finds parent of a node }; #endif Use the following menu in your program. MENU 1. Insert node(s) 2. Traverse In-order 3. Search node 4. Delete node 5. Leaf Count 6.…
Assume the function: void F(stack<T> &S){ } and we send a stack S to the function F, as a result of it إختر أحد الخيارات: a. Both (copy constructor and destructor) should be called b. Both (copy constructor and destructor) should not be called c. Destructor should be called d. Copy constructor should be called