CSE 15 Lecture Notes - Lecture 16: C Dynamic Memory Allocation, C String Handling, Binary Search Tree
Document Summary
Quiz 5 is at the end of class next tuesday. Final mcdowell"s first draft of final is always stapling all quizzes together. A general tree t is a set of one or more nodes such that t is partitioned into disjointed subsets: Sets that are general trees, called subtrees of r. A binary tree is a set t of nodes such that either. Two possibly empty sets that are binary trees, called left and right. A binary search tree that has the following properties for each node n n"s value is greater than all values in its left subtree t(l) n"s value is less than all values in its right subtree t(r) A level of a node n in a tree t. If n is the root of t, it is at level 1. If n is not the root of t< its level is 1 greater than the level of its parent.
