pkstruct 0.1.2__tar.gz → 0.1.3__tar.gz

{pkstruct-0.1.2 → pkstruct-0.1.3}/CHANGELOG.md

@@ -5,6 +5,13 @@ All notable changes to pkstruct will be documented in this file.
 The format follows [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [0.1.3] - 2026-06-16
+
+### Fixed
+- README PriorityQueue examples corrected: `push()`/`pop()` → `enqueue()`/`dequeue()`
+- README BST traversal examples corrected: use `pkstruct.trees.traversal` module, `zigzag` → `zigzag_order`
+- `__version__` bumped to 0.1.3
+
 ## [0.1.2] - 2026-06-16
 
 ### Added

{pkstruct-0.1.2 → pkstruct-0.1.3}/MANIFEST.in

@@ -1,9 +1,6 @@
 include README.md
 include LICENSE
 include CHANGELOG.md
-include SECURITY.md
-include CODE_OF_CONDUCT.md
-include CONTRIBUTING.md
 recursive-include src/pkstruct *.py *.pyi
 global-exclude __pycache__
 global-exclude *.py[co]

{pkstruct-0.1.2 → pkstruct-0.1.3}/PKG-INFO

@@ -1,12 +1,10 @@
 Metadata-Version: 2.4
 Name: pkstruct
-Version: 0.1.2
-Summary: A production-grade, open-source Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing
+Version: 0.1.3
+Summary: A production-grade Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing
 Project-URL: Homepage, https://github.com/prnvvv/pkstruct
 Project-URL: Repository, https://github.com/prnvvv/pkstruct
 Project-URL: Documentation, https://github.com/prnvvv/pkstruct#readme
-Project-URL: Bug Tracker, https://github.com/prnvvv/pkstruct/issues
-Author: pkstruct Contributors
 Author-email: Prannavakhanth <prannavakhanth12@gmail.com>, Priyanka Kaliraj <pri2303k@gmail.com>
 License: MIT License
         
@@ -63,7 +61,7 @@ Description-Content-Type: text/markdown
 
 # pkstruct
 
-**A production-grade, open-source Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing.**
+**A production-grade Python library providing comprehensive data structures and algorithms with type hints, thread safety, and extensive testing.**
 
 [![PyPI](https://img.shields.io/pypi/v/pkstruct)](https://pypi.org/project/pkstruct/)
 [![Python](https://img.shields.io/pypi/pyversions/pkstruct)](https://pypi.org/project/pkstruct/)
@@ -81,7 +79,7 @@ Description-Content-Type: text/markdown
 | Need | pkstruct gives you |
 |------|-------------------|
 | **Interview prep** | Linked lists, trees, graphs with LeetCode-style helpers (palindrome, cycle detection, LCA, topological sort, etc.) |
-| **Production code** | Thread-safe structures (`threading.RLock`), strict type hints, 898+ tests |
+| **Production code** | Thread-safe structures (`threading.RLock`), strict type hints, 899+ tests |
 | **Learning DSA** | Consistent API across all structures, built-in ASCII visualization, runtime help system |
 | **Competitive programming** | Drop-in collection of trees (BST, AVL, Red-Black, Fenwick, Segment, Interval) and graph algorithms (Dijkstra, Kruskal, Tarjan, etc.) |
 
@@ -301,7 +299,7 @@ ArrayStack().daily_temperatures([73, 74, 75]) # [1, 1, 0]
 q = LinkedQueue([1, 2, 3])
 q.enqueue(4)
 q.dequeue()      # 1
-q.peek()         # 2
+q.front()        # 2
 
 # LeetCode extras
 LinkedQueue().sliding_window_maximum([1,3,-1,-3,5,3,6,7], 3)  # [3,3,5,5,6,7]
@@ -314,9 +312,9 @@ cq.dequeue()     # 1
 
 # ── Priority Queue (min-heap) ──
 pq = PriorityQueue()
-pq.push("task1", priority=3)
-pq.push("task2", priority=1)
-pq.pop()         # "task2"
+pq.enqueue("task1", priority=3)
+pq.enqueue("task2", priority=1)
+pq.dequeue()     # "task2"
 
 # LeetCode extras
 PriorityQueue().kth_largest([3,2,1,5,6,4], 2)  # 5
@@ -325,10 +323,10 @@ PriorityQueue().top_k_frequent([1,1,1,2,2,3], 2)  # [1, 2]
 # ── Deque ──
 d = LinkedDeque([1, 2, 3])
 d.append(4)
-d.appendleft(0)
-d.pop()          # 4
-d.popleft()      # 0
-d.rotate(2)      # rotate right by 2
+d.append(0, side="left")   # append to left side
+d.pop()                    # 4 (from right)
+d.pop(side="left")         # 0 (from left)
+d.rotate(2)                # rotate right by 2
 ```
 
 ### Linear — Utilities
@@ -375,17 +373,17 @@ run_full_benchmark()                            # full suite
 bst = BinarySearchTree()
 bst.insert(10, value="ten")
 bst.insert(5, value="five")
-bst[5]                       # "five"  (via __getitem__)
 bst.search(10)               # ("ten", Node)
 bst.delete(5)
 len(bst)                     # 1
 
-# Traversals
-list(bst.inorder())          # [5, 10, 15]
-list(bst.preorder())         # [10, 5, 15]
-list(bst.postorder())        # [5, 15, 10]
-list(bst.level_order())      # [10, 5, 15]
-list(bst.zigzag())           # [10, 15, 5]
+# Traversals (via standalone functions)
+from pkstruct.trees.traversal import inorder, preorder, postorder, levelorder
+list(inorder(bst.root))          # [5, 10, 15]
+list(preorder(bst.root))         # [10, 5, 15]
+list(postorder(bst.root))        # [5, 15, 10]
+list(levelorder(bst.root))       # [10, 5, 15]
+list(bst.zigzag_order())          # [10, 15, 5]
 
 # Navigation Shortcuts
 bst.root                     # root node
@@ -496,6 +494,7 @@ from pkstruct.trees.tree_helpers import (
     validate_bst_order, path_to_node,
     level_of_node, max_width,
 )
+from pkstruct.trees.node import TreeNode
 
 # Traversal functions (work on any binary tree root)
 bst = BinarySearchTree()
@@ -746,16 +745,6 @@ run_full_benchmark()
 
 ---
 
-## 🤝 Contributing
-
-We welcome contributions! See [CONTRIBUTING.md](CONTRIBUTING.md) to get started.
-
-- [Code of Conduct](CODE_OF_CONDUCT.md)
-- [Issue Tracker](https://github.com/prnvvv/pkstruct/issues)
-- [Feature Requests](https://github.com/prnvvv/pkstruct/issues/new?template=feature_request.md)
-
----
-
 ## 🔧 Development
 
 ```bash
@@ -778,7 +767,7 @@ ruff check src/pkstruct
 
 ## 📄 License
 
-MIT © pkstruct Contributors
+MIT © Prannavakhanth & Priyanka Kaliraj
 
 ## 🙌 Credits