CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-01 17:53:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add implementation of array binary tree.

Browse Source 
Rewrite the tree serialization and deserialization methods.
Add applications of array and linked list.
This commit is contained in:
krahets
2023-07-19 16:09:27 +08:00
parent c68f18e480
commit 4e13755023
26 changed files with 680 additions and 178 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/cpp/chapter_backtracking/preorder_traversal_i_compact.cpp
View File

@@ -23,7 +23,7 @@ static void preOrder(TreeNode *root) {
/* Driver Code */
int main() {
TreeNode *root = vecToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
TreeNode *root = vectorToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
cout << "\n初始化二叉树" << endl;
printTree(root);

2
codes/cpp/chapter_backtracking/preorder_traversal_ii_compact.cpp
View File

@@ -28,7 +28,7 @@ static void preOrder(TreeNode *root) {
/* Driver Code */
int main() {
TreeNode *root = vecToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
TreeNode *root = vectorToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
cout << "\n初始化二叉树" << endl;
printTree(root);

2
codes/cpp/chapter_backtracking/preorder_traversal_iii_compact.cpp
View File

@@ -29,7 +29,7 @@ static void preOrder(TreeNode *root) {
/* Driver Code */
int main() {
TreeNode *root = vecToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
TreeNode *root = vectorToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
cout << "\n初始化二叉树" << endl;
printTree(root);

2
codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp
View File

@@ -56,7 +56,7 @@ void backtrack(vector<TreeNode *> &state, vector<TreeNode *> &choices, vector<ve
/* Driver Code */
int main() {
TreeNode *root = vecToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
TreeNode *root = vectorToTree(vector<int>{1, 7, 3, 4, 5, 6, 7});
cout << "\n初始化二叉树" << endl;
printTree(root);