Given a binary tree T and a source node s in it, provide the pseudocode for an iterative algorithm to traverse T starting from s using breadth-first traversal, also known as level-order traversal. Each node in T contains an integer key that can be accessed. Each time a node is visited, its key should be printed. Note: You do not have to implement your algorithm.

Let T be a binary search tree with n nodes, in which n > 0. When T is linear, the search algorithm makes key comparisons, in the unsuccassful case.

In a binary search tree, to remove a node N that has parent P and one child C, we do the following:   Group of answer choices If C is the right child of N, we make C the right child of P, and if C is the left child of N, we make C the left child of P   If C is the right child of N, we make C the left child of P, and if C is the left child of N, we make C the right child of P   If N is the left child of P, we make C the left child of P and if N is the right child of P, we make C the right child of P   If N is the left child of P, we make C the right child of P and if N is the right child of P, we make C the left child of P   none of the above

A Binary Search Tree (BST) can be used to efficiently implement a sorted set. It stores uniquevalues and offers an efficient membership method (contains).A binary search tree (BST) is a binary tree with the additional binary search tree property.The binary search tree property states that for every node n in the tree1. n.data is greater than the data value of all nodes in the sub-tree rooted with n.left.2. n.data is less than the data value of all nodes in the sub-tree rooted with n.right.As we are implementing a set, all data (strings) in the tree will be unique. Every node in the treewill have its own distinct string. Strings will be compared using the canonical way (as defined bythe compareTo() method in the String class).For example, the binary tree on the left (below) IS a binary search tree and the one on the rightis NOT.You will implement several methods in the BinaryTree and BST classes. The BST class mustextend the BinaryTree class. Methods that you must complete (implement or…

Write a code to implement binary search tree. Implement all the methods, find, insert, delete, minimum, max, find successor. Test out all the methods.

In this problem, we need to create a method capable of calculating the distance  between the deepest node on the left to the deepest node on the right. However my code is struggling to even output my binary search tree, and I am not sure how to code the method. Can someone please explain how I could code this?/////////////////////////////////////////////////////////////////////////// // // Pro3105 // //      Write a program that creates a binary search tree of 15 to 30 //      random Capital Letters. // //      Define the tree width operation by writing the method that will //      calculate the distance from the deepest node of the left subtree //      to the deepest node of the right subtree. // //                           K //                  ......../ \.......................... //                 /                                     \ //                H                                       U //            .../ \.....                         ......./ \... //           /…

How would you reverse the order of nodes in a singly linked list? Provide an algorithm and discuss its time complexity.

Don't skip