From d375c06124e2d719e4e80d19a7ee0f3de37de62b Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 18 Mar 2025 13:35:50 -0400 Subject: [PATCH] revising readme --- lectures/18_trees_I/README.md | 10 ++++------ lectures/19_trees_II/README.md | 2 -- 2 files changed, 4 insertions(+), 8 deletions(-) diff --git a/lectures/18_trees_I/README.md b/lectures/18_trees_I/README.md index a17a8a7..d97b046 100644 --- a/lectures/18_trees_I/README.md +++ b/lectures/18_trees_I/README.md @@ -9,7 +9,6 @@ - Binary trees, binary search trees - Implementation of ds_set class using binary search trees -- In-order, pre-order, and post-order traversal ## Overview: Lists vs Trees vs Graphs - Trees create a hierarchical organization of data, rather than the linear organization in linked lists (and arrays and vectors). @@ -134,9 +133,7 @@ int count_odd (TreeNode* int) ## 18.7 ds_set and Binary Search Tree Implementation -- A partial implementation of a set using a binary search tree is provided in this [ds_set_starter.h](ds_set_starter.h). We will continue to study this implementation in Lab 10 & the next lecture. -- The increment and decrement operations for iterators have been omitted from this implementation. Next week -in lecture we will discuss a couple strategies for adding these operations. +- A partial implementation of a set using a binary search tree is provided in this [ds_set_starter.h](ds_set_starter.h). - We will use this as the basis both for understanding an initial selection of tree algorithms and for thinking about how standard library sets really work. @@ -145,9 +142,10 @@ about how standard library sets really work. - There is two auxiliary classes, TreeNode and tree_iterator. All three classes are templated. - The only member variables of the ds_set class are the root and the size (number of tree nodes). - The iterator class is declared internally, and is effectively a wrapper on the TreeNode pointers. - – Note that operator* returns a const reference because the keys can’t change. + + – Note that operator\* returns a const reference because the keys can't change. - – The increment and decrement operators are missing (we’ll fill this in next week in lecture!). + – The increment and decrement operators are missing (we'll fill this in next week in lecture!). - The main public member functions just call a private (and often recursive) member function (passing the root node) that does all of the work. diff --git a/lectures/19_trees_II/README.md b/lectures/19_trees_II/README.md index 8971526..ba3bc26 100644 --- a/lectures/19_trees_II/README.md +++ b/lectures/19_trees_II/README.md @@ -1,6 +1,4 @@ # Lecture 19 --- Trees, Part II -## Announcements -- Read the syllabus thoroughly for late days and extension policies -> https://www.cs.rpi.edu/academics/courses/spring24/csci1200/syllabus.php ## Review from Lecture 18