feat: 更新二叉树相关内容

Author: chachaxw

binarytree/binary_tree.cpp

@@ -2,7 +2,7 @@
  * @Author: Chacha
  * @Date: 2018-11-24 13:31:24
  * @Last Modified by: Chacha
- * @Last Modified time: 2021-03-10 12:02:36
+ * @Last Modified time: 2021-03-30 14:30:46
  * @Source: 二叉树 https://leetcode-cn.com/leetbook/detail/data-structure-binary-tree/
  *          二叉树的遍历详解 https://shimo.im/docs/MAbjWlrqWqU1f72m
  */
@@ -423,7 +423,7 @@ int PrintLevel1(TreeNode *root, int n, int level)
 /**
  * 递归方式2
  *
- * 采用层次递减的方式，level = n为希望递归的层次，而层次每深入一次，level递减，当level=0时，则说明递归至第n层
+ * 采用层次递减的方式，level = n为希望递归的层次，而层次每深入一次，level递减，当 level = 0 时，则说明递归至第n层
  *
  * root: 树的根
  * n: 希望打印的层次

leetcode/binary_search_tree/binary_search_tree_iterator.cpp

@@ -2,7 +2,7 @@
  * @Author: Chacha
  * @Date: 2018-12-16 21:53:13
  * @Last Modified by: Chacha
- * @Last Modified time: 2021-03-26 18:03:47
+ * @Last Modified time: 2021-03-30 14:03:05
  */
 
 /***********************************************************************************

leetcode/binary_tree/max_depth_binary_tree.cpp

@@ -12,7 +12,7 @@
  * 来源: https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/
  *
  * 示例：
- * 给定二叉树 [3,9,20,null,null,15,7]
+ * 给定二叉树 [3, 9, 20, null, null, 15, 7]
  *   3
  *  / \
  * 9  20
@@ -116,10 +116,27 @@ int maxDepthIterative(TreeNode *root)
     return max_depth;
 }
 
+TreeNode *insertLevelOrder(int arr[], TreeNode *root, int i, int n)
+{
+    // Base case for recursion
+    if (i < n)
+    {
+        TreeNode *temp = new TreeNode(arr[i]);
+        root = temp;
+
+        // insert left child
+        root->left = insertLevelOrder(arr, root->left, 2 * i + 1, n);
+
+        // insert right child
+        root->right = insertLevelOrder(arr, root->right, 2 * i + 2, n);
+    }
+    return root;
+}
+
 int main()
 {
-    TreeNode node = {3, 9, 20, NULL, NULL, 15, 7};
-    const int maxDepth = maxDepthIterative(node);
+    int arr[] = {3, 9, 20, NULL, NULL, 15, 7};
+    // const int maxDepth = maxDepthIterative();
 
-    cout << "Max depth is " << maxDepth << endl;
+    // cout << "Max depth is " << maxDepth << endl;
 }