how can you see the genealogy of the lord of the rings staff using this program in python? from _future_ import print_functionclass Node:def __init__(self, label):self.label = labelself._parent = Noneself._left = Noneself._right = Noneself.height = 0@propertydef right(self):return self._right@right.setterdef right(self, node):if node is not None:node._parent - selfself._right = node@propertydef left(self):return self._left@left.setterdef left(self, node):if node is not None:node._parent = selfself. left node@propertydef parent (self):return self._parent@parent.setterdef parent (self, node):if node is not None:self._parent = nodeself.height = self.parent.height + 1else:self.height = 0class AVL:def __init__(self):self.root = Noneself.size = 0def insert (self, value):node Node (value)if self.root is None:self.root nodeself.root.height = 0self.size=1else:dad_node - Nonecurr_node = self.rootwhile True:if curr_node is not None:dad_node = curr_nodeif node.label < curr_node.label:curr_node = curr_node.leftelse:else:curr_node = curr_node.rightnode.height = dad_node.heightdad_node.height += 1if node.label < dad_node.label:dad_node.left = nodeelse:dad_node.right = nodeself.rebalance (node)self.size += 1break 81828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122def rebalance(self, node):n = nodewhile n is not None:height_right = n.heightheight_left = n.heightif n.right is not None:height_right = n.right.heightif n.left is not None:height_left = n.left.heightif abs(height_left - height_right) > 1:if height_left > height_right:left_child-n.leftif left_child is not None:h_left=if (h_left > h_right):self.rotate_left(n)else:125126127128129130131132133134135136137138139140141if (left_child.right is not None) else 0)(left_child.left.height142143if (left_child.left is not None) else 0)144145146147h_right = (left_child.right.heightelse:breakn = n.parentself.double_rotate_right(n)breakright_child = n.rightif right_child is not None:h_right = (right_child.right.heightif (right_child.right is not None) else 0)h_left= (right_child.left.heightif (right_child.left is not None) else 0)if (h_left > h_right):self.double_rotate_left(n)breakelse:self.rotate_right(n)break123124148149150151152153154155156157158159160161162163164def rotate_left(self, node):aux node.parent.labelnode.parent.label node.labelnode.parent.right = Node (aux)node.parent.right.height = node.parent.height + 1node.parent.left = node.rightdef rotate_right(self, node):aux node.parent.label=node.parent.label = node.labelnode.parent.left - Node (aux)node.parent.left.height = node.parent.height + 1node.parent.right = node.rightdef double rotate_left(self, node):self.rotate_right(node.getRight().getRight())self.rotate_left(node)def double_rotate_right(self, node):self.rotate_left (node.getLeft().getLeft())self.rotate_right(node)def empty(self):if self.root is None:return Truereturn Falsedef preShow(self, curr_node):if curr_node is not None:self.preShow(curr_node.left)print(curr_node.label, end=" ")self.preShow(curr_node.right)def preorder (self, curr_node):if curr_node is not None:self.preShow (curr_node.left)self.preShow(curr_node.right)print(curr_node.label, end-" ")def getRoot (self):return self.root

It is defined as a simple, general purpose, high level, and object-oriented programming language. It…

Answered: n you see the genealogy of the lord of…

Engineering

Computer Science

n you see the genealogy of the lord of the rings staff using this program in python?

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

class Student: def __init__(self, id, fn, ln, dob, m='undefined'): self.id = id self.firstName = fn self.lastName = ln self.dateOfBirth = dob self.Major = m def set_id(self, newid): #This is known as setter self.id = newid def get_id(self): #This is known as a getter return self.id def set_fn(self, newfirstName): self.fn = newfirstName def get_fn(self): return self.fn def set_ln(self, newlastName): self.ln = newlastName def get_ln(self): return self.ln def set_dob(self, newdob): self.dob = newdob def get_dob(self): return self.dob def set_m(self, newMajor): self.m = newMajor def get_m(self): return self.m def print_student_info(self): print(f'{self.id} {self.firstName} {self.lastName} {self.dateOfBirth} {self.Major}')all_students = []id=100user_input = int(input("How many students: "))for x in range(user_input): firstName = input('Enter…
> > ©Citizen ©Company model model • licenseNo: String e location: String expiryDate: Date Company(int, String,String,String,Date) • getLicenseNo() String • setLicenseNo(String).void • getLocation() String • setlocation(String) void • getExpiryDate().Date • setExpiryDate(Date).void • toString() String nationalNo: int - bDate: Date nationality: String FCitizen(int,String,int,Date,String) • getNationalNo() int • setNationalNo(it) void • getbDate():Date • setbDate(Date):void • getNationality() String • setNationality(String) void toString() String > ©Customer model -bookings • book • cance id: int name: String FCustomer(int,String) • removeBookedObject(int).void • getBookings() ArrayList • setBookings(ArrayList)void • getid()int • setid(int).void • getName():String • setName(String) void • getTotalPayment() double toString() String -booki -customers <
function removeErrMsgs() { var errMessages = document.getElementsByClassName('msg');for (let msg of errMessages) {msg.innerHTML = "";}}function validateValues() {var toBeReturned = true;removeErrMsgs();var fname = document.getElementById("fname").value;if (fname.length > 30) {document.getElementsByClassName('msg')[0].innerHTML = "First name can not be longer than 30 characters";toBeReturned = false;} var lname = document.getElementById("lname").value;if (lname.length > 30) {document.getElementsByClassName('msg')[1].innerHTML = "Last name can not be longer than 30 characters";toBeReturned = false;} var phone = document.getElementById('num').value;if (phone.length > 8) {document.getElementsByClassName('msg')[2].innerHTML = "Phone number can not be greater than 8 numbers";toBeReturned = false;} var items = document.getElementById('items').value;if (items > 4 || items < 2) {document.getElementsByClassName('msg')[3].innerHTML = "Item numbers should be between 1 and…
DiceSet Class in Python Write a class named DiceSet that contains a list of Die objects. Fields dice a list of Die objects Methods __init__(self, dice_faces) The constructor should instantiate the dice list to an empty list if no parameters are set. The constructor should take a list of integers. Add one die to the dice set for each integer with the number of faces equal to the integer. pop_die(self, value) Remove and return the first die with the given value from the list. add_die(self, die) Adds the given die (of class Die) to the dice list. roll(self) Roll all the die objects in the list of dice and return their sum. die_values(self) Return a list of the int values (last rolls) of the dice in the list. __str__(self) returns a string version of a dice set. Example: "{[d3] 1, [d6] 4, [d12] 5, [d4] 3}"
Implement all the classes using Java programming language from the given UML Class diagram. Note: This problem requires you to submit just two classes: Customer.java, Account.java. Do NOT include "public static void main()" method inside all of these classes. Graders will be testing your classes, using the unit-testing framework JUnit 4. Customer - ID:int -name:String -gender:char 'm' or 'f' +Customer(ID:int,name:String, discount:int) +getID():int +getName ():String +getGender ():char +toString():String "name (ID)" The Customer class models, customer design as shown in the class diagram. Write the codes for the Customer class and a test driver to test all the public methods. Account
class Polynomial: class TermNode:def __init__(self, coefficient: int, exponent: int) -> None:"""Initialize this node to represent a polynomial term with thegiven coefficient and exponent. Raise ValueError if the coefficent is 0 or if the exponentis negative."""if coefficient == 0:raise ValueError("TermNode: zero coefficient")if exponent < 0:raise ValueError("TermNode: negative exponent") self.coeff = coefficientself.exp = exponentself.next = None def __init__(self, coefficient: int = None, exponent: int = 0) -> None:"""Initialize this Polynomial with a single term constructed from thecoefficient and exponent. If one argument is given, the term is a constant coefficient(the exponent is 0).If no arguments are given, the Polynomial has no terms. # Polynomial with no terms:>>> p = Polynomial()>>> print(p._head)None>>> print(p._tail)None # Polynomial with one term (a constant):>>> p = Polynomial(12)>>> p._head.coeff12>>>…
Python This is what I have class linkedQueue: class _Node: def __init__(self, value, next = None): self._data = value self._next = next def get_data(self): return self._data def set_data(self, value): self._data = value def get_next(self): return self._next def set_next(self, nodetopoint = None): self._next = nodetopoint def __init__(self): self._head = None self._tail = None self._size = 0 def enqueue(self, itemValue): # Inserts a new item (the data of the item is set to itemValue) at the end of the queue and returns True. If unable to insert the item (due to error) return false. node = self._Node(itemValue) if self._head is None: self._head = node else: self._tail._next = node self._tail = node self._size += 1 return True def dequeue(self): # Removes the item…
#employee.py class Employee: def__init__(self,Emp_name,Emp_id): self.__Emp_name=Emp_name self.__Emp_id=Emp_id defset_Empname(self,Emp_name): self.__Emp_name=Emp_name defset_Empid_number(self,Emp_id): self.__Emp_id=Emp_id defget_Empname(self): returnself.__Emp_name defget_Empid_number(self): returnself.__Emp_id class ProductionWorker(Employee): def__init__(self,Emp_name,Emp_id,Emp_shift, Emp_pay_rate): Employee.__init__(self,Emp_name,Emp_id) self.__Emp_shift=Emp_shift self.__Emp_pay_rate=Emp_pay_rate defset_Empshift_number(self,Emp_shift): self.__Emp_shift=Emp_shift defset_Emppay_rate(self,Emp_pay_rate): self.__Emp_pay_rate=Emp_pay_rate defget_Empshift_number(self): returnself.__Emp_shift defget_Emppay_rate(self): returnself.__Emp_pay_rate def main(): Employee_name='' Employee_id='' Employee_shift=0 Employee_pay=0.0 Employee_name=input('Enter the employee name: ') Employee_id=input('Enter the employee ID number: ') Employee_shift=int(input('Enter the employee shift number: '))…
In python program some issue find the issue class Node: def __init__(self,data): self.wait = data; self.next = None; class CreateList: def __init__(self): self.head = Node(1); self.tail = Node(2); self.tail.next = self.tail; def addAtStart(self,data): newNode = Node(data); if self.head.data is None: self.head = newNode; self.tail = newNode; newNode.next = self.head; else: newNode.next = temp; self.head = newNode; self.tail.next = self.head; def display(self): current = self.head; if self.head is None: print("List is empty"); return; else: print(current.data), while(current.next != self.head): current =…
// CONSTANT// static const int MAX_SIZE = ____// IntSet::MAX_SIZE is the highest # of elements an IntSet// can accommodate.// CONSTRUCTOR// IntSet()// Pre: (none)// Post: The invoking IntSet is initialized to an empty// IntSet (i.e., one containing no relevant elements).// CONSTANT MEMBER FUNCTIONS (ACCESSORS)// int size() const// Pre: (none)// Post: Number of elements in the invoking IntSet is returned.// bool isEmpty() const// Pre: (none)// Post: True is returned if the invoking IntSet has no relevant// relevant elements, otherwise false is returned.// bool contains(int anInt) const// Pre: (none)// Post: true is returned if the invoking IntSet has anInt as an// element, otherwise false is returned.// bool isSubsetOf(const IntSet& otherIntSet) const// Pre: (none)// Post: True is returned if all elements of the invoking IntSet// are also elements of otherIntSet, otherwise false…
Book Donation App Create a book-app directory. The app can be used to manage book donations and track donors and books. The catalog is implemented using the following classes: 1. The app should have donors-repo.js to maintain the list of donors and allow adding, updating, and deleting donors. The donor object has donorID, firstName, lastName, and email properties. This module should implement the following functions: • getDonor(donorId): returns a donor by id. • addDonor(donor): adds a donor to the list of donors; donorID should be autoassigned a random number. • updateDonor(donor): updates the donor having the matching donorID. • deleteDonor(donorID): delete the donor with donorID from the list of donors, only if they are not associated with any books. 2. The app should have books-repo.js to maintain the list of donated books and allow adding, updating, and deleting books. The book object has bookID, title, authors, and donorID properties. • donorID references the book’s donor. This…
Problem 2: Route Planning You are on the development team for a Route Planning application. The team has already developed a class named NavigatorApp for storing and displaying the graph representing the road network. This class has a void displayShortestPath() function which takes the source and destination vertices of the trip and displays the shortest route between them. Using the strategy pattern, draw a class diagram of the system which will allow for the NavigatorApp to display the shortest driving, walking, or cycling route when the displayShortestPath() function is called. You can assume that another developer is in charge of making sure the appropriate strategy is correctly set and for calling the displayShortestPath() function Starter code /* Modify NavigatorApp (if necessary) */ class NavigatorApp { private: Graph map; public: void displayMap(Window * window); void displayShortestPath(Vertex source, Vertex destination, Window * window); /* write pseudo code for this function…