Rust Day 13: Leetcode — Minimum Depth of Binary Tree

Today was an Okish day! I am progressing, as well as managing my studies. I will be focusing my energy on learning TiKV and TiDB soon. TiKV & TiDB seems to have been written with a perfect choice of language. There are many Databases which have taken inspiration from Google Spanner and PingCAP is one amount them. So for now, let's head straight to the problem.

Problem:

Minimum Depth of Binary Tree - LeetCode

Logic:

Code:

Syntax:

1. match is used when you have to deal with Option.
2. match( a.left.clone(), a.right.clone() ) is used for pair combinations.
3. Use clone whenever you are lending control of a variable to a block or a function. You can use .as_ref() as well, I guess.

Reference:

• https://leetcode.com/problems/minimum-depth-of-binary-tree/discuss/1659709/rust-implementation

Found it Interesting?

Please show your support by 👏.