IB Comp Sci SL - December 9 2016 Lesson Notes: Difference between revisions
Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||
Line 44: | Line 44: | ||
== [[File:ourstandards.png]] Standards we are covering today == | == [[File:ourstandards.png]] Standards we are covering today == | ||
* Describe | * Describe how trees operate logically (both binary and non-binary). | ||
* Define the terms: parent, left-child, right-child, subtree, root and leaf. | |||
* | * State the result of inorder, postorder and preorder tree traversal. | ||
* | * Sketch binary trees. | ||
* | |||
* [[IB Computer Science SL standards | Click here for all our standards]] | * [[IB Computer Science SL standards | Click here for all our standards]] | ||
Latest revision as of 12:32, 9 December 2016
What are we going to learn today?[edit]
|
What is our homework?[edit]
|
|
How am I being assessed today?[edit]
|
||
Standards we are covering today[edit]
|
As a computer scientist, you have:[edit]
|
|
Credits[edit] |