Each node is seen two times so the time complexity is linear in the number of nodes which is at least O(2 n ).
only nodes that have encountered at least one training instance are useful and there are O(n × k) such nodes (where k the size of the training set).