Skip to content

Latest commit

 

History

History
9 lines (8 loc) · 677 Bytes

TODO.md

File metadata and controls

9 lines (8 loc) · 677 Bytes

TODO for Binary Tree and BST Implementation

  • Create java/BinaryTree.java with Node class, traversals (inorder, preorder, postorder), views (top, bottom, left, right), utilities (height, size), and sample driver in main.
  • Create java/BinarySearchTree.java with Node class, insert, delete, search methods, traversals, and sample driver in main.
  • Compile both Java files to check for errors.
  • Run the sample drivers to verify output.
  • Commit the new files to the blackboxai/dijkstra-algorithm branch (or new branch if needed).
  • Push the changes to GitHub.
  • Create a pull request using GitHub CLI (requires user to run gh auth login first).