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

Method Solution

543. Diameter of Binary Tree/Solution.cpp:25–25  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

23 int cnt;
24public:
25 Solution():cnt(0) {}
26
27 int depth(TreeNode * root) {
28 if (root == NULL) return 0;

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected