COMS W3134 Lecture Notes - Lecture 7: Longest Path Problem, Linked List, Tree Traversal

• School: Columbia University
• Department: Computer Science
• Course: COMS W3134
• Professor: Paul Blaer

Document Summary

G n leaf root parent , sibling , children , uncle , grandparent. Leaf node : node with no kids path length : number of edges trees are usually singly - linked , no back - link ( depends on implementation ) v. * special case : linked list tree node implementations. User directory (cid:15482) root node leaf if empty. I tree command - recursion ( tree traversal ) root (cid:15482) child (cid:15482) child "s child (cid:15482) etc. A print name of object for each file c in this directory ( each child : list all i depth t ili g post - order traversal. I or 2 children class binary tree node it > l. Full binary tree : every node either has 0 or 2 children. I binary tree worst case : 01n ) height complete binary tree ( for all binary trees ) Fill all possible nodes at each level before moving to next level .