From 408dc0dfa5f3d5b7f587cf65eaa9584729d8f9eb Mon Sep 17 00:00:00 2001
From: liuchuo <95323362@qq.com>
Date: Tue, 17 Nov 2020 02:09:23 +0800
Subject: [PATCH] Update 1099. Build A Binary Search Tree (30).cpp

---
 AdvancedLevel_C++/1099. Build A Binary Search Tree (30).cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/AdvancedLevel_C++/1099. Build A Binary Search Tree (30).cpp b/AdvancedLevel_C++/1099. Build A Binary Search Tree (30).cpp
index 64dd6d5..8bad0b2 100644
--- a/AdvancedLevel_C++/1099. Build A Binary Search Tree (30).cpp	
+++ b/AdvancedLevel_C++/1099. Build A Binary Search Tree (30).cpp	
@@ -4,13 +4,13 @@
 using namespace std;
 int n, cnt, b[100], maxLevel;
 struct node {
-    int data, l, r, level;
+    int data, l, r;
 }a[110];
 vector<int> v[100];
 void dfs(int root, int level) {
     maxLevel = max(level, maxLevel);
     if (a[root].l != -1) dfs(a[root].l, level + 1);
-    a[root] = {b[cnt++], a[root].l, a[root].r, level};
+    a[root] = {b[cnt++], a[root].l, a[root].r};
     if (a[root].r != -1) dfs(a[root].r, level + 1);
 }
 int main() {