- Published on
Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.
All Posts
All Posts
- python (52)
- algorithm (52)
- dfs (16)
- tree (15)
- graph (10)
- linked-list (8)
- binary-search-tree (6)
- stack (4)
- two-pointers (4)
- hashmap (3)
- bfs (3)
- ai (2)
- machine-learning (2)
- binary-tree (2)
- dijkstras-algorithm (2)
- sorting (2)
- 2024-google-ml-bootcamp (1)
- deep-learning (1)
- mathematics (1)
- books (1)
- courses (1)
- defaultdict (1)
- trie (1)
- palindrome (1)
- heap (1)
- priority-queue (1)
- recursion (1)
- counter (1)
- typing (1)
- deque (1)
- slicing (1)
- Published on
Given the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.- Published on
Given the root of a Binary Search Tree (BST), convert it to a Greater Sum Tree- Published on
Given the root of a Binary Search Tree (BST), convert it to a Greater Sum Tree- Published on
Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.