@@ -152,7 +152,7 @@ BinarySearchTree.prototype.remove = function(key) {
152
152
* * searchResult - true if node was found
153
153
* * node - searched node if it was found, otherwise last checked node
154
154
*
155
- * @private
155
+ * @protected
156
156
*/
157
157
BinarySearchTree . prototype . _search = function ( key , root ) {
158
158
var nkey , node = root || this . _root ;
@@ -185,7 +185,7 @@ BinarySearchTree.prototype._search = function(key, root) {
185
185
*
186
186
* @param parent
187
187
* @param child
188
- * @private
188
+ * @protected
189
189
*/
190
190
BinarySearchTree . prototype . _linkNodes = function ( parent , child ) {
191
191
child . p = parent ;
@@ -197,7 +197,7 @@ BinarySearchTree.prototype._linkNodes = function(parent, child) {
197
197
/**
198
198
* Remove specified node
199
199
* @param node
200
- * @private
200
+ * @protected
201
201
*/
202
202
BinarySearchTree . prototype . _removeNode = function ( node ) {
203
203
var parent = node . p ;
@@ -213,7 +213,7 @@ BinarySearchTree.prototype._removeNode = function(node) {
213
213
* @param root Subtree root node
214
214
* @returns Node with minimum key
215
215
*
216
- * @private
216
+ * @protected
217
217
*/
218
218
BinarySearchTree . prototype . _getMinNode = function ( root ) {
219
219
var node = root || this . _root ;
@@ -232,7 +232,7 @@ BinarySearchTree.prototype._getMinNode = function(root) {
232
232
* @param root Subtree root node
233
233
* @returns Node with maximum key
234
234
*
235
- * @private
235
+ * @protected
236
236
*/
237
237
BinarySearchTree . prototype . _getMaxNode = function ( root ) {
238
238
var node = root || this . _root ;
0 commit comments