Skip to content

Commit 462e29a

Browse files
committed
feat: 更新二叉树相关内容
1 parent 7537374 commit 462e29a

File tree

3 files changed

+24
-7
lines changed

3 files changed

+24
-7
lines changed

binarytree/binary_tree.cpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
* @Author: Chacha
33
* @Date: 2018-11-24 13:31:24
44
* @Last Modified by: Chacha
5-
* @Last Modified time: 2021-03-10 12:02:36
5+
* @Last Modified time: 2021-03-30 14:30:46
66
* @Source: 二叉树 https://leetcode-cn.com/leetbook/detail/data-structure-binary-tree/
77
* 二叉树的遍历详解 https://shimo.im/docs/MAbjWlrqWqU1f72m
88
*/
@@ -423,7 +423,7 @@ int PrintLevel1(TreeNode *root, int n, int level)
423423
/**
424424
* 递归方式2
425425
*
426-
* 采用层次递减的方式,level = n为希望递归的层次,而层次每深入一次,level递减,当level=0时,则说明递归至第n层
426+
* 采用层次递减的方式,level = n为希望递归的层次,而层次每深入一次,level递减,当 level = 0 时,则说明递归至第n层
427427
*
428428
* root: 树的根
429429
* n: 希望打印的层次

leetcode/binary_search_tree/binary_search_tree_iterator.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
* @Author: Chacha
33
* @Date: 2018-12-16 21:53:13
44
* @Last Modified by: Chacha
5-
* @Last Modified time: 2021-03-26 18:03:47
5+
* @Last Modified time: 2021-03-30 14:03:05
66
*/
77

88
/***********************************************************************************

leetcode/binary_tree/max_depth_binary_tree.cpp

Lines changed: 21 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212
* 来源: https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
1313
*
1414
* 示例:
15-
* 给定二叉树 [3,9,20,null,null,15,7]
15+
* 给定二叉树 [3, 9, 20, null, null, 15, 7]
1616
* 3
1717
* / \
1818
* 9 20
@@ -116,10 +116,27 @@ int maxDepthIterative(TreeNode *root)
116116
return max_depth;
117117
}
118118

119+
TreeNode *insertLevelOrder(int arr[], TreeNode *root, int i, int n)
120+
{
121+
// Base case for recursion
122+
if (i < n)
123+
{
124+
TreeNode *temp = new TreeNode(arr[i]);
125+
root = temp;
126+
127+
// insert left child
128+
root->left = insertLevelOrder(arr, root->left, 2 * i + 1, n);
129+
130+
// insert right child
131+
root->right = insertLevelOrder(arr, root->right, 2 * i + 2, n);
132+
}
133+
return root;
134+
}
135+
119136
int main()
120137
{
121-
TreeNode node = {3, 9, 20, NULL, NULL, 15, 7};
122-
const int maxDepth = maxDepthIterative(node);
138+
int arr[] = {3, 9, 20, NULL, NULL, 15, 7};
139+
// const int maxDepth = maxDepthIterative();
123140

124-
cout << "Max depth is " << maxDepth << endl;
141+
// cout << "Max depth is " << maxDepth << endl;
125142
}

0 commit comments

Comments
 (0)