vahagn/test
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

preorder_tree_construction.cpp building with vc

Browse Source
This commit is contained in:
Vahagn Khachatryan
2018-04-22 23:28:45 +01:00
parent 44344d9428
commit 2f9acbc4c8
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
puzzles/interviews/training/preorder_tree_construction.cpp
View File

@@ -1,4 +1,5 @@
#include <vector> #include <vector>
#include <string>
#include <iostream> #include <iostream>
struct node { struct node {
@@ -39,7 +40,7 @@ node * prefix_to_tree( const std::vector<double>& v ){
node * tmp = max_node; node * tmp = max_node;
max_node = max_node->root; max_node = max_node->root;
if ( max_node && tmp == max_node->left ){ if ( max_node && tmp == max_node->left ){
break; break;
} }
} }
} else { } else {
@@ -99,4 +100,4 @@ int main( void ) {
test( {8, 4, 2, 1, 6, 12, 10, 11, 14, 15} ); test( {8, 4, 2, 1, 6, 12, 10, 11, 14, 15} );
return 0; return 0;
} }