binary search tree(bst)

/Tag:binary search tree(bst)
­

[Leetcode] Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

November 14th, 2015|Categories: DS and Algorithms, Tree|Tags: , , , , , |

[Leetcode] Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

[Leetcode] Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

[Leetcode] Binary Search Tree Iterator

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST

November 16th, 2015|Categories: DS and Algorithms, Stack, Tree|Tags: , , , , , |