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

Update README.md

Browse Source
This commit is contained in:
NehaKeshan
2024-04-02 11:33:07 -04:00
committed by GitHub
parent fe897be394
commit 11bf8cf89d
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lectures/21_trees_IV/README.md
View File

@@ -1,7 +1,7 @@
# Lecture 21 --- Trees, Part IV # Lecture 21 --- Trees, Part IV
Review from Lecture 19 Review from Lecture 20
- Breadth-first and depth-first tree search - Breadth-first and depth-first tree search
- Increement/decrement operator - Increement/decrement operator
- Tree height, longest-shortest paths, breadth-first search - Tree height, longest-shortest paths, breadth-first search
@@ -77,7 +77,9 @@ Which nodes are red?
## 21.3 Trinary Tree ## 21.3 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 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. the examples below, the tree on the left will return true and the tree on the right will return false.
```cpp ```cpp