This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from qiskit.providers.fake_provider import FakeCasablanca | |
from qiskit.circuit.random import random_circuit | |
from qiskit_trebugger import Debugger | |
import warnings | |
warnings.simplefilter('ignore') | |
debugger = Debugger(view_type = "cli") | |
backend = FakeCasablanca() | |
circuit = random_circuit(num_qubits = 4, depth = 5 , seed = 44) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from qiskit.providers.fake_provider import FakeCasablanca | |
from qiskit.circuit.random import random_circuit | |
from qiskit_trebugger import Debugger | |
import warnings | |
warnings.simplefilter('ignore') | |
debugger = Debugger(view_type = "jupyter") | |
backend = FakeCasablanca() | |
circuit = random_circuit(num_qubits = 4, depth = 5 , seed = 44) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Deleting a node from Binary search tree */ | |
#include<iostream> | |
using namespace std; | |
struct Node { | |
int data; | |
struct Node *left; | |
struct Node *right; | |
}; | |
//Function to find minimum in a tree. | |
Node* FindMin(Node* root) |