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

more on height

Browse Source
This commit is contained in:
Jidong Xiao
2024-04-03 21:59:39 -04:00
parent f4d39548bb
commit 5bac59d600
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
lectures/20_trees_III/README.md
View File

@@ -90,7 +90,7 @@ memory usage of this algorithm? Give a specific example tree that illustrates ea
## 20.4 Height and Height Calculation Algorithm ## 20.4 Height and Height Calculation Algorithm
- The height of a node in a tree is the length of the longest path down the tree from that node to a leaf node. The height of a leaf is 1. We will think of the height of a null pointer as 0. - The height of a node in a tree is the length of the longest path down the tree from that node to a leaf node. The height of a tree with only one node (the root node) is 1. The height of an empty tree (a tree with no nodes) is 0.
- The height of the tree is the height of the root node, and therefore if the tree is empty the height will be 0. Exercise: Write a simple recursive algorithm to calculate the height of a tree. - The height of the tree is the height of the root node, and therefore if the tree is empty the height will be 0. Exercise: Write a simple recursive algorithm to calculate the height of a tree.
   
@@ -125,7 +125,7 @@ another method of writing the above code
unsigned int height(Node* p) unsigned int height(Node* p)
{ {
if (p) return 0; if (p==NULL) return 0;
return 1 + std::max(height(p->left), height(p->right)); return 1 + std::max(height(p->left), height(p->right));
} }