LintCode - Binary Tree & Divide and Conquer

Traverse the Binary Tree

preorder  (visit, left, right)

Binary Tree Preorder Traversal [easy]

inorder     (left, visit, right)

Binary Tree Inorder Traversal [easy]

postorder(left, right, visit)

Binary Tree Postorder Traversal [easy]

DFS in Binary Tree

divide & conquer vs traverse

Maximum Depth of Binary Tree [easy]

Binary Tree Paths

Minimum Subtree

Balanced Binary Tree

Subtree with Maximum Average

Lowest Common Ancestor

binary search tree (insert remove find validate)

Validate Binary Search Tree

Convert Binary Search Tree to Doubly Linked List

Flatten Binary Tree to Linked List

Binary Search Tree Iterator

In-order Successor in Binary Search Tree

Search Range in Binary Search Tree

Insert Node in a Binary Search Tree

Remove Node in a Binary Search Tree

猜你喜欢

转载自blog.csdn.net/real_lisa/article/details/83988648
今日推荐