How to Flip Equivalent Binary Trees?
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is …
Tag: C implementation
How do you Design a Circular FIFO Buffer (Queue) in C?
I was recently being asked by this question: How do you Design a Circular FIFO (First-In First-out) Buffer (Queue) in C? You need to implement two methods: fifoRead and …
