Hacktoberfestadd codenew algorithm
Repository metrics
- Stars
- (13,462 stars)
- PR merge metrics
- (30d に merged PR はありません)
説明
In this the right ptr of leaf node points to it's inorder predecessor and the rightmost leaf of the right sub-tree from the root will have both left and right ptrs as NULL Thus this eliminates the overhead of building a stack, since traversal can be done via loop, instead of recursion.