Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/find-mode-in-binary-search-tree/ Given the root of a binary search tree (BST) with duplicates, return all the mode(s) (i.e., the most frequently occurred element) in it.…
Description https://leetcode.com/problems/find-all-the-lonely-nodes/ In a binary tree, a lonely node is a node that is the only child of its parent node. The…
Description https://leetcode.com/problems/closest-binary-search-tree-value/ Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target.…
Description https://leetcode.com/problems/two-sum-iv-input-is-a-bst/ Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST…
Description https://leetcode.com/problems/average-of-levels-in-binary-tree/ Given the root of a binary tree, return the average value of the nodes on each level in the form of…
Description https://leetcode.com/problems/increasing-order-search-tree/ Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is…
Description https://leetcode.com/problems/univalued-binary-tree/ A binary tree is univalued if every node in the tree has the same value. Return true if and only if the…
Description https://leetcode.com/problems/invert-binary-tree/ Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6…
Description https://leetcode.com/problems/n-ary-tree-postorder-traversal/ Given an n-ary tree, return the preorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level order…
Description https://leetcode.com/problems/n-ary-tree-postorder-traversal/ Given an n-ary tree, return the postorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level order…