Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th ...

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. ExampleInput: 123451 \ 3 / ...

Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Exa ...

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

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. NoteYou may assume k is always valid, 1 ≤ k ≤ BST’s t ...

If the depth of a tree is smaller than 5, this tree can be represented by a list of three-digits integers. For each integer in this list: The hundred ...

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length. Do not allocate extra ...

Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive integers. ...

Given inorder and postorder traversal of a tree, construct the binary tree. NoteYou may assume that duplicates do not exist in the tree. For example, ...

Given preorder and inorder traversal of a tree, construct the binary tree. NoteYou may assume that duplicates do not exist in the tree. For example, g ...