Tests/binarysearch

[adasarpan404]

This pull request introduces significant improvements to the BinarySearchTree implementation and its documentation, as well as enhanced testing for both the binary search tree and circular queue data structures. The main focus is on expanding BST functionality with new view helper methods, refactoring the BST class to use prototype-based JavaScript, improving documentation, and adding comprehensive tests for edge cases and new features.

Binary Search Tree Enhancements:

• Refactored BinarySearchTree and Node from ES6 classes to prototype-based functions for consistency and compatibility. (nonLinear/binarySearchTree.js)
• Added new helper methods: levelOrder, leftView, rightView, and topView for various tree traversals and views. (nonLinear/binarySearchTree.js)
• Updated documentation to describe new BST features and provide usage examples for the new view helpers. (Readme.md) [1] [2]

Testing Improvements:

• Added comprehensive tests for all BST operations, including the new view helpers, edge cases (empty tree, single node, skewed trees, duplicate values), and complex removal scenarios. (tests/binarySearchTree.test.js) [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]
• Improved and expanded tests for the circular queue, covering wrap-around behavior, empty queue edge cases, and internal pointer logic. (tests/circularQueue.test.js)

Documentation and Versioning:

• Enhanced the project description in the Readme.md to highlight the library's scope, use cases, and new features. (Readme.md) [1] [2]
• Bumped the package version to 3.1.0 to reflect the new features and improvements. (package.json)

[Copilot]

Pull Request Overview

This pull request introduces significant improvements to the BinarySearchTree implementation and its documentation, as well as enhanced testing for both the binary search tree and circular queue data structures. The main focus is on expanding BST functionality with new view helper methods, refactoring the BST class to use prototype-based JavaScript, improving documentation, and adding comprehensive tests for edge cases and new features.

• Refactored BinarySearchTree and Node from ES6 classes to prototype-based functions for consistency and compatibility
• Added new BST helper methods: levelOrder, leftView, rightView, and topView for various tree traversals and views
• Reorganized tests by moving stack and queue tests to dedicated files and added comprehensive BST and circular queue edge case testing

Reviewed Changes

Copilot reviewed 9 out of 10 changed files in this pull request and generated 4 comments.

Show a summary per file

File	Description
uses/postfixConversion.js	Refactored function to use modern JavaScript syntax with better variable naming
tests/stack.test.js	Moved stack tests from index.test.js to dedicated file
tests/queue.test.js	Moved queue tests from index.test.js to dedicated file
tests/index.test.js	Simplified to only test basic exports
tests/circularQueue.test.js	Added comprehensive tests for wrap-around behavior and edge cases
tests/binarySearchTree.test.js	Added extensive tests for new BST view methods and edge cases
package.json	Version bumped to 3.1.0
nonLinear/binarySearchTree.js	Refactored to prototype-based functions and added new view helper methods
Readme.md	Updated documentation with new BST features and improved examples

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Copilot]

The levelOrder method call is missing the required node parameter. It should be bst.levelOrder(root) to match the implementation.

Suggested change

	console.log(bst.levelOrder()) // -> [15, 10, 20]
	console.log(bst.levelOrder(root)) // -> [15, 10, 20]

[Copilot]

The leftView method call is missing the required node parameter. It should be bst.leftView(root) to match the implementation.

Suggested change

	console.log(bst.rightView()) // -> [15, 20]
	console.log(bst.levelOrder()) // -> [15, 10, 20]
	console.log(bst.leftView(root)) // -> [15, 10]
	console.log(bst.rightView()) // -> [15, 20]

[Copilot]

The rightView method call is missing the required node parameter. It should be bst.rightView(root) to match the implementation.

Suggested change

	console.log(bst.topView()) // -> [10, 15, 20] // leftmost -> rightmost horizontal distance
	console.log(bst.leftView()) // -> [15, 10]
	console.log(bst.rightView(root)) // -> [15, 20]
	console.log(bst.topView()) // -> [10, 15, 20] // leftmost -> rightmost horizontal distance

[Copilot]

The topView method call is missing the required node parameter. It should be bst.topView(root) to match the implementation.

Suggested change

	console.log(bst.topView()) // -> [10, 15, 20] // leftmost -> rightmost horizontal distance
	console.log(bst.topView(root)) // -> [10, 15, 20] // leftmost -> rightmost horizontal distance