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

Update README.md

Browse Source 
updated Red Black Tree and the Trinary Tree content with Red Black Tree example image
This commit is contained in:
NehaKeshan
2024-03-29 12:01:35 -04:00
committed by GitHub
parent 19f42d7a85
commit fd97b8b3c6
1 changed files with 21 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
lectures/21_trees_IV/README.md
View File

@@ -26,6 +26,7 @@ modifications to the data structure:
- All paths from a particular node to a NULL child pointer contain the same - All paths from a particular node to a NULL child pointer contain the same
number of black nodes. number of black nodes.
![alt text](Red_Black.png "Red_Black Tree example")
What tree does our **ds_set** implementation produce if we insert the What tree does our **ds_set** implementation produce if we insert the
numbers 1-14 **in order**? numbers 1-14 **in order**?
@@ -61,26 +62,25 @@ What is the best/average/worst case shortest-path from root to leaf node in a re
## Exercise 21.2 ## Exercise 21.2
Fill in the tree on the right with the integers 1-7 to make a binary search tree. Also, color each node "red" or "black" so that the tree also fulfills the requirements of a Red-Black tree. Fill in the tree on the right with the integers 1-7 to make a binary search tree. Also, color each node "red" or "black" so that the tree also fulfills the requirements of a Red-Black tree.
![alt text](Red_Black_fillin.png "Red_Black Tree Fill In example")
- Draw a diagram of a possible memory layout for a ds set containing the numbers 16, 2, 8, 11, and 5. Is there Which nodes are red?
only one valid memory layout for this data as a ds set? Why?
**Note:** Red-Black Trees are just one algorithm for **self-balancing binary search tress**. We have many more, including the AVL trees that we discussed last week.
 
  ## Trinary Tree
 
  A **trinary tree** is similar to a binary tree except that each node has at most 3 children. Write a **recursive** function named **EqualsChildrenSum** that takes one argument, a pointer to the root of a trinary tree, and returns true if the value at each non-leaf node is the sum of the values of all of its children and false otherwise. In
  the examples below, the tree on the left will return true and the tree on the right will return false.
 
```cpp
- In what order should a forward iterator visit the data? Draw an abstract table representation of this data class Node {
(omits details of TreeNode memory layout). public:
int value;
  Node* left;
  Node* middle;
  Node* right;
  };
  ```