BST
In-place merge two height-balanced BSTs
// A BST node class Node int knowledge; Node left, proper; Node(int knowledge) this.knowledge = knowledge; this.left = this.proper = null;
Menu
// A BST node class Node int knowledge; Node left, proper; Node(int knowledge) this.knowledge = knowledge; this.left = this.proper = null;
import java.util.ArrayDeque; import java.util.Queue; // A Binary Tree Node class TreeNode int knowledge; TreeNode left, proper; TreeNode(int knowledge) this.knowledge = knowledge; this.left