Recent content by alyafey22

I am working on deep learning as well but as part of the Masters program. For those interested to see some battles between stockfish and AlphaZero watch this with some commentary lFXJWPhDsSY

It is a computer vision competition . The question is, given an image how many sea lions are there ? Actually it is more complicated since it asks for the type as well.

I am currently participating in a competition to recognize sea lions. The competition is fierce to be honest with many previous winners but it is always a good experience that you learn from. Also the Cash prize is a good incentive.

$$(2n)! = 1 \times 2 \times \cdots (2n-1)(2n) \leq 2 \times 2 \cdots (2n) (2n) = 4^n(n!)^2$$ Hence $$\sum_{n=1}^\infty \frac{10^n (n!)^2}{(2n)!} \geq \sum_{n=1}^\infty \left( \frac{5}{2}\right)^n$$

Seems correct for me.

The right hand side should be as a function of $n$.

Please write your initial attempt.

What is unclear about the pseudocode ?

I think it should work but u have an extra else statement that has no effect since the value can be either ><=.

Before you search in the here._left and here._right you have to make sure they are not None. If they are just put here._left = Node or here._right = Node , else search the subtree.

What methods are expected to use ? what have you tried so far ?

You are close. what about the case when you have a non-empty tree and you want to insert a non-existent variable? The node of that variable must be inserted as a leaf node but you don't have a base case for that.

In your implementation of the insert method, you are returning a node. Shouldn't you update the tree ?

What exactly is the problem you are facing ? Let is start with the insert method. Is it working correctly ?

You can use the mathematical induction.