CSE 2331 Lecture 16: Lecture 16
10 Mar 2020
School
Department
Course
Professor
Document Summary
2 in which and each each a unique key such that if y the left is in subtree af bst is node node has has i of x of x then g key ex key. Ci if g is then y key in x keys the right subtree which tree is better. 6 if you don"t the distribution queries go w most balanced know much about root to end count edged height. Onlyneed to know howmany on the left 01 right. Ways to traverse a bst in order left root right. Bt pree assignto binarytree array aei r points to the root of distinct integers pointer. A pointer r tree w n nodes i n of a binary the nodes in that tree. Assign the valuesof 4 to the key fields of soft a i inordertree walk ofkeysassigned so far to make it: h i mogn so as.
