Remove max_depth in native MerkleTree (#442)

This simplifies the MerkleTree (and container) API.
Defer the max depth check when assigning the witness (merkle proof siblings) to the merkle tree circuit.

In this implementation the native Merkle Tree branches grow as much as they needed.  There are no checks of max depth in the merkle tree.  All keys are 256 bits (I added a debug_assert for this); so in the worst case a path will have depth 256.  It can't have a longer depth because the `insert` method calls `prove_nonexistence` which errors if the key already exists; another one may exist which must be different and thus require a path <= 256 depth. 

Resolve #436

examples/main_pod_points.rs

@@ -35,7 +35,7 @@ fn main() -> Result<(), Box<dyn std::error::Error>> {
     let mock_prover = MockProver {};
     let real_prover = Prover {};
     let (vd_set, prover): (_, &dyn MainPodProver) = if mock {
-        (&VDSet::new(8, &[])?, &mock_prover)
+        (&VDSet::new(&[]), &mock_prover)
     } else {
         println!("Prebuilding circuits to calculate vd_set...");
         let vd_set = &*DEFAULT_VD_SET;

examples/signed_dict.rs

@@ -30,10 +30,7 @@ fn main() -> Result<(), Box<dyn std::error::Error>> {
         .into_iter()
         .map(Value::from)
         .collect();
-    builder.insert(
-        "friends",
-        Set::new(params.max_merkle_proofs_containers, friends_set)?,
-    );
+    builder.insert("friends", Set::new(friends_set));
 
     // Sign the dict and verify it
     let signed_dict = builder.sign(&signer)?;