When poll is active respond at
PollEv.com​/pds
Send
pds
to
22333
For a BST with N nodes, the average case time complexity of a post-order traversal is
169
O(1)
0%
0
O(log N)
3%
5
O(N)
92%
156
O(N log N)
4%
7
O(N^2)
0%
0
O(2^N)
1%
1
See more
Powered by