Skip to content

Comments

Tree Traversal Algo addition#1149

Closed
ghost wants to merge 5 commits intomasterfrom
unknown repository
Closed

Tree Traversal Algo addition#1149
ghost wants to merge 5 commits intomasterfrom
unknown repository

Conversation

@ghost
Copy link

@ghost ghost commented Jul 3, 2024

Changes Made:

  • Implemented binary tree traversal techniques: inorder, preorder, and postorder in BinarySearchTree.js.

  • Added findMax() method in BinarySearchTreeNode.js.

Details:

Binary Tree Traversal Techniques:

  • Implemented inorder traversal, where nodes are visited in left subtree, root, then right subtree order.
  • Implemented preorder traversal, where nodes are visited in root, left subtree, then right subtree order.
  • Implemented postorder traversal, where nodes are visited in left subtree, right subtree, then root order.

findMax() Method:

  • Added findMax() method in BinarySearchTreeNode.js to retrieve the maximum value stored in the binary search tree.

Folders Added:

  • inorder-traversal: Implemented in order traversal technique
  • preorder-traversal: Implemented preorder traversal technique
  • postorder-traversal: Given implementation for post order traversal.

Files Modified

  • BinarySearchTreeNode.js: Added findMax() method.

@ghost ghost closed this by deleting the head repository Jul 30, 2025
This pull request was closed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant