![]() |
recover-a-tree-from-preorder-traversal 1.0.0
Recover a Tree From Preorder Traversal
|
#include <bits/stdc++.h>
Go to the source code of this file.
Data Structures | |
| struct | TreeNode |
| class | Solution |
Functions | |
| void | bfs_print (TreeNode *root) |
| void | delete_tree (TreeNode *root) |
| int | main () |
| void bfs_print | ( | TreeNode * | root | ) |
Definition at line 70 of file main.cpp.
References TreeNode::left, TreeNode::right, and TreeNode::val.
Referenced by main().
| void delete_tree | ( | TreeNode * | root | ) |
Definition at line 90 of file main.cpp.
References delete_tree(), TreeNode::left, and TreeNode::right.
Referenced by delete_tree(), and main().
| int main | ( | ) |
Definition at line 102 of file main.cpp.
References bfs_print(), delete_tree(), and Solution::recoverFromPreorder().