CS 2150 Lecture Notes - Lecture 11: Binary Search Tree, Avl Tree, Binary Tree
18 Feb 2016
School
Department
Course
Professor
Document Summary
3: for computing: no, we can compute everything with just lists. On average, go through half of it. the same place. Each of the junctions, true structure of the internet years ago. Structure of the internet is an application of a tree: tree terminology, binary search tree operations relationship though root. Internal path length: sum of the depths of all the nodes. From selected node to: depth: length of the path from that node up to the root vii, examples of trees: files, expressions, geneaology ix. First child/next sibling: allows for an arbitrary number of children for a node, something we haven"t seen: always print left sub tree before the right sub tree xi. In-order: left, node, right (only time to deal with parenthesis) before: binary trees: each node has potentially 2 children, can have less but not more than. Less than, equal, or greater can always be used to form binary tree.
