DJWhy does a BT’s height equal log n?You may have heard in different tutorials that a balanced Binary Tree has a height of log n.Apr 8, 2020Apr 8, 2020
DJWhy Heap Sort runs in O(n log n) timeHeap sort consists of creating the heap & then removing all the nodes from that heap. The nodes will sort themselves out by the time all…Apr 8, 2020Apr 8, 2020
DJAll In One — iOS Lifecycles, States, Sandbox, FileSystem, Main Bundle, UIApplication, AppDelegateSo here I will break down what you need to make sure you know at least about these topics already.Jan 23, 2019Jan 23, 2019