Category: Linked List

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;