Log in
HomeClass Notes1,200,000US530,000

ALGORITHMS Lecture Notes - Erik Demaine, Binary Tree, Linked List

3 views6 pages
oualiyacine1995
24 Oct 2022
School
MIT
Department
Mathematics
Course
ALGORITHMS
Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Instructors: erik demaine, jason ku, and justin solomon. 1(a) log n n n n log n. Goal n n log n u n(e) n log n n log n. Order find prev(k) delete(k) find max() find next(k) n n. 1 u n log n log n n log n u n log n. Binary trees: pointer-based data structures (like linked list) can achieve worst-case performance, binary tree is pointer-based data structure with three pointers per node, node representation: node. node item parent | left right | Every node in node "s left subtree is before Every node in node "s right subtree is after

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

ALGORITHMS Lecture : Johnson’s Algorithm1
oualiyacine1995
ALGORITHMS Lecture Notes - Erik Demaine, Topological Sorting, Dynamic Programming
oualiyacine1995
ALGORITHMS Lecture Notes - Erik Demaine, Adjacency List, Linked List
oualiyacine1995

Related Questions

  1. Assume the existence of a class Queue whose implementation is unknown (array versus nodes), with operations enqueue, dequeue and isEmpty(). Write a Queue method void reverseQueue() that reverses the order of the elements contained in the Queue. You can assume the existence of any other ADT data structures and their operations.

1. Assume the existence of a class Stack whose implementation is unknown (array versus nodes), withoperationspushandpop. Write a Stack methodvoid reverseStack()that reverses the order of theelements contained in the Stack. You can assume the existence of any other ADT data structures andtheir operations.

  1. Assume the existence of a class Queue whose implementation is unknown (array versus nodes), with operations enqueue, dequeue and isEmpty(). Write a Queue method void reverseQueue() that reverses the order of the elements contained in the Queue. You can assume the existence of any other ADT data structures and their operations.
  2.  Assuming the following queue implemented using an array with wraparound 

    Redraw the queue after each of the following “consecutive” operations. In each case, show the contents of the queue as well as the positions of Front and Back.

    (a)    enqueue (3);

    (b)   dequeue ();

    (d)    enqueue (7);

    (e)    dequeue ();

    (c) enqueue (5);