Implement a binary tree with the following criteria: - 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

True or False: Any node in a tree can be viewed as being the root of its own tree.

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).

kl 00 C no m n d Answer the following questions for the tree shown above. Is the tree balanced? (answer y for yes, n for no)