Implement a binary tree with the following criteria: - using java - Minimum 5 nodes (including root) - Arbitrary value for each node - At least 1 node has leftChild and rightChild Then print / output the binary tree. Examples of expected output: 10 / \ 6 12 / \ \ 5 8 14

Problem#1: A combinational circuit is defined by the following three Boolean functions. Implement the circuit with a decoder constructed with NAND gates and external NAND gates. F1 (A, B, C) = Em(0, 5, 7) F2(A, В, C) %3D 2m(2, 3, 4) F3 (A, В, С) %3DZM(1, 6, 7) Зx8 Decoder mo m1 B m2 m3 m4 m5 m6 m7

Use Java to create a Binary Search Tree Class with the following Operations: Insert(int n) : add a node the tree with value n. Its O(lgn) Find(int n) : find a node the tree with value n. Its O(lgn) Delete (int n) : delete a node the tree with value n. Its O(lgn) Display(): prints the entire tree in increasing order. O(n).

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):