Fundamental algorithms for finding a specific node in trees and graphs, their efficiency measured in O(n) and O(log n) time complexity