I need help on Python exam about data structure
Question Description
will be next Monday,(MAY 11)
from 3:30 to 5:30 pm( American Easten Time)
It will run on mycourses, and will be similar in
structure to the midterm test: short answers.
The video from Monday’s review session is now on Canvas.
Here are the topics you should study for the test:
user-defined objects
– __init__ and __str__ methods
– how to define the methods
– how to call the methods
aliasing
– assigning a mutable object gives you a reference
linked lists
– add_front, add_tail, contains, remove
– with/without sentinels
stacks and queues
– given sequence of push/pop, what is the output
– given the output, what is the sequence of push/pop
– applications
– syntax checking
– infix to postfix
– postfix eval
– postfix to tree
postfix
– evaluate postfix expression
– convert infix to postfix
trees
– expression trees (AKA syntax trees)
– infix to tree
– traversal (pre-, post-, and in-order)
– size, height, balance factors
– what are they
– code to implement them
BSTs
– search, insert
– traversal
Sorting
– bubble
– insertion
– best-case, worst-case complexity
—
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."