IB Comp Sci HL - December 9 2016 Lesson Notes

What are we going to learn today? We will review basic data types We will review abstract data structures We will review linked list We will review stacks We will review queues We will learn about trees We will learn about binary trees We will learn about tree traversal You will review our homework for the weekend	What is our homework? Please complete your homework. This is due by our next class.
How am I being assessed today? You will be formatively assessed in class today
Standards we are covering today 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. Click here for all our standards	As a computer scientist, you have: Confidence in dealing with complexity Persistence in working with difficult problems Tolerance for ambiguity The ability to deal with open-ended problems The ability to communicate and work with others to achieve a common goal or solution
Credits Icons used with tremendous gratitude by Freepik from flaticon

Give a detailed account or picture of a situation, event, pattern or process.

Give the precise meaning of a word, phrase, concept or physical quantity.

Give a specific name, value or other brief answer without explanation or calculation.

Give a specific name, value or other brief answer without explanation or calculation.

Represent by means of a diagram or graph (labelled as appropriate). The sketch should give a general idea of the required shape or relationship, and should include relevant features.