CS 223 - Spring 2017. 3/27

Welcome to CS 223!

Larry Wall Quote of the day

The road to heaven is paved with good extensions.

Logical problem of the day

char *f(){ 
  char result[80]; 
  sprintf(result,"anything will do"); 

int main(int argc, char **argv){ 
  char *p; 
  p = f(); 
  printf("f() returns: %s\n",p);
What's up up there?

Lecture 16: HW5 + Data Structures: btrees, AVL trees, heaps


  • Office hours:
    The office hours are Sun/Tue/Thu 8-11 PM at Hillhouse 17 Rm 111.
  • My office hours this week are Wednesday 3-5pm.

  • https://www.startupyale.com/prizes/ Yale Prizes $25,000: deadline 3/30/17.

  • http://yalecompsociety.org/prize

    Assignment 5 - Revision

    Problem set 5 revision

  • Add balanced tree option to hw5, using -avl flag.
  • See /c/cs223/hw5/Cloudavlx
  • See AVL Trees AVLtree.h AVLtree.c AVLtree.output
  • Here is one way to do it: (how I did it)

    Lecture Starts Here

    Binary Trees