Tirth Patel

Create a binary tree given its `preorder` and `inorder` traversals or `postorder` and `inorder` traversals.

Implement and reverse: 1. Singly Linked List 2. Doubly Linked List 3. Circular singly linked list. 4. Circular doubly linked list

[Greedy Algorithms](https://github.com/tirthasheshpatel/Data-Structures-and-Algorithms/tree/master/Greedy%20Algorithms) contains the file [huffman_codes.c](https://github.com/tirthasheshpatel/Data-Structures-and-Algorithms/blob/master/Greedy%20Algorithms/huffmann_codes.c) which is not implemented yet. Go ahead and try to implement it!

Fixes some of the failures seen in https://github.com/keras-team/keras-cv/actions/runs/8259807616/job/22594330565?pr=2383 One of the tests in SAM changed the global dtype policy. Until now, if the test failed, the policy was never reset...

Segment Anything - Next Steps

5

### Segment Anything model in KerasCV #1987 added the Segment Anything model to KerasCV but it needs a guide to demonstrate training and prompting the trained model. It would also...