MCPcopy Create free account
hub / github.com/Ainevsia/Leetcode-Rust / Solution

Method Solution

99. Recover Binary Search Tree/Solution.cpp:27–27  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

25 TreeNode * prev;
26public:
27 Solution():sw1(NULL), sw2(NULL), prev(new TreeNode(1 << 31)) {}
28
29 void traverse(TreeNode * root) {
30 if (root == NULL) return ;

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected