{"openapi":"3.1.0","info":{"title":"BST Visualizer","description":"Interactive binary search tree: insert, delete and search values with animated comparisons, plus step-by-step in-order, pre-order, post-order and level-order traversals.","version":"1.0"},"servers":[{"url":"https://dabbled.ai"}],"paths":{"/apps/bst-visualizer":{"get":{"operationId":"bstVisualizer","summary":"Interactive binary search tree: insert, delete and search values with animated comparisons, plus step-by-step in-order, pre-order, post-order and level-order traversals.","parameters":[{"name":"value","in":"query","required":false,"description":"Integer value to insert, delete or search","schema":{"type":"number"}},{"name":"duplicate_policy","in":"query","required":false,"description":"How duplicate values are handled","schema":{"type":"string","enum":["Reject duplicates","Count in node","Place right"]}},{"name":"traversal_type","in":"query","required":false,"description":"Traversal order","schema":{"type":"string","enum":["In-order","Pre-order","Post-order","Level-order"]}},{"name":"speed","in":"query","required":false,"description":"Animation speed in seconds per step (0.1–2.0)","schema":{"type":"number"}},{"name":"random_count","in":"query","required":false,"description":"How many random values to generate","schema":{"type":"number"}}],"responses":{"200":{"description":"Rendered app reflecting the given inputs."}}}}}}