JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adjusting format

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-26 10:55:06 -04:00
parent 0c3d2f2bbb
commit de77ad72d5
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
lectures/17_trees_I/README.md
View File

@@ -75,7 +75,7 @@ tree structure for a given set of values is not unique!
3. How many exactly balanced binary search trees exist with these numbers? How many exactly balanced 3. How many exactly balanced binary search trees exist with these numbers? How many exactly balanced
binary trees exist with these numbers? binary trees exist with these numbers?
## 17.5 Beginning our implementation of ds set: The Tree Node Class ## 17.5 Beginning our implementation of ds_set: The Tree Node Class
- Here is the class definition for nodes in the tree. We will use this for the tree manipulation code we write. - Here is the class definition for nodes in the tree. We will use this for the tree manipulation code we write.
@@ -141,6 +141,7 @@ finding the node in the tree that stores the smallest value.
The “doing something”, which is often just printing, is referred to generically as “visiting” the node. The “doing something”, which is often just printing, is referred to generically as “visiting” the node.
- There are three general orders in which binary trees are traversed: pre-order, in-order and post-order. - There are three general orders in which binary trees are traversed: pre-order, in-order and post-order.
In order to explain these, let’s first draw an “exactly balanced” binary search tree with the elements 1-7: In order to explain these, let’s first draw an “exactly balanced” binary search tree with the elements 1-7:
– What is the in-order traversal of this tree? Hint: it is monotonically increasing, which is always true for – What is the in-order traversal of this tree? Hint: it is monotonically increasing, which is always true for
an in-order traversal of a binary search tree! an in-order traversal of a binary search tree!